[ruby-core:87189] Re: [Ruby trunk Feature#14767] [PATCH] gc.c: use monotonic counters for objspace_malloc_increase

=D0=BF=D1=82, 18 =D0=BC=D0=B0=D1=8F 2018 =D0=B3., 11:47 Eric Wong <normalpe=
[e-mail]>:

> Eric Wong <[e-mail]> wrote:
> > OK.  Also, did we ever consider signed type (`ssize_t`) for malloc
> > counters instead?  This may be more useful if we switch to
> > thread-local storage for counters to avoid atomics.
>
> Reverted for now because of regressions in:
>
>             bm_array_sample_100k__6k
>             bm_array_sample_100k___10k
>             bm_array_sample_100k___50k
>
> I think the original unsigned + underflow avoidance code
> prevented us from accounting free() properly, and we were
> triggering GC more as a result.
>
> With this patch, frees are accounted properly so malloc_increase
> grew too slowly...
>

Why triggerring GC less frequently considered as disadvantage?
I think, real aplications will benefit from it.
Why this benchmarks suffers from it?


> Also, I think it would be beneficial to check malloc_increase
> and do a lazy sweep step BEFORE calling malloc, since that should
> improve cache locality in malloc (because they're usually LIFO).
>
> Unsubscribe: <mailto:[e-mail]?subject=3Dunsubscrib=
e>
> <http://lists.ruby-lang.org/cgi-bin/mailman/options/ruby-core>
>

Unsubscribe: <mailto:[e-mail]?subject=unsubscribe>
<http://lists.ruby-lang.org/cgi-bin/mailman/options/ruby-core>