This is the mail archive of the libc-alpha@sourceware.org mailing list for the glibc project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: Enhancing malloc


On 28 May 2013 20:46, Carlos O'Donell <carlos@redhat.com> wrote:
> On 05/28/2013 08:54 AM, Siddhesh Poyarekar wrote:
>> On Tue, May 28, 2013 at 02:33:17PM +0200, OndÅej BÃlka wrote:
>>> Malloc and friends are one of few libc functions which can be measured
>>> directly. They account to about 50% of time spend in libc. I know that gcc
>>> hevavily uses malloc. So authoritative test could be if following is
>>> improvement or not:
>>>
>>> for I in `seq 1 10` do
>>> echo new
>>> LD_PRELOAD=new_malloc.so time gcc test.c
>>> echo old
>>> time gcc test.c
>>> done
>>>
>>> You must take into account that malloc requests are small. I did some
>>> measurements at
>>> http://kam.mff.cuni.cz/~ondra/benchmark_string/malloc_profile_28_11_2012.tar.bz2
>>
>> For malloc and friends, the comparison should also include the effect
>> of the change on fragmentation (internal as well as external) and not
>> just speed of execution.
>
> I agree.
>
> In glibc's allocator we consciously try to collesce fastbins and use
> MADV_DONTNEED to give back unused pages.
>
> We could get a performance boost by looking at the new vrange support.
> Such support has already been tested in jemalloc and shown to potentially
> improve performance.

Are there specific design goals of the current code? For example, if a
new implementation increased memory usage but increased performance
would that be acceptable?

I agree that a comprehensive set of benchmarks would seem to be the
logical first step.

--
Will Newton
Toolchain Working Group, Linar


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]