Rpmalloc – a faster memory allocator (new release)
rpmalloc 1.1 released, with improved performance, easier configuration, adaptive cache sizes and additional benchmarks including jemallochttps://github.com/rampantpixels/rpmalloc
rpmalloc 1.1 released, with improved performance, easier configuration, adaptive cache sizes and additional benchmarks including jemallochttps://github.com/rampantpixels/rpmalloc
The goal is of course not to replace the standard allocator, but rather to offer an alternative for those cases where the standard allocator performs poorly.
In your case, the block will be marked as free for allocation. If it is the last used block in that span, the span will eventually be returned to the global cache and reused by other heaps/threads when the owner thread ends. If the span is still used, it will remain in the heap until the heap is picked up by another thread. Heaps are reused as threads are joined and created (i.e number of allocated heaps are the maximum number of concurrent threads since process started).
The worst case is that one thread allocates blocks, hands them off to other threads then ends, and that the process never creates additional threads. In this case, the spans will remain mapped and unused. I have planned to allow other threads to pick up and collect spans from unused heaps at some point to solve this.
Graphs and analysis for a Linux system will be added soon, but a spoiler:
rpmalloc 22.7m memory ops/CPU second, 26MiB bytes peak, 15% overhead
jemalloc 21.3m memory ops/CPU second, 30MiB bytes peak, 33% overhead
tcmalloc 20.4m memory ops/CPU second, 30MiB bytes peak, 32% overhead
crt 13.5m memory ops/CPU second, 24MiB bytes peak, 7% overhead
rpmalloc is faster and has less overhead than both jemalloc and tcmalloc, and a lot faster than glibc at the cost of extra memory overhead.
The reasoning behind the granularities is that 16 bytes is a reasonable granularity for smaller objects (below 2KiB in size). Medium sized requests (between 2KiB and 32KiB) have a 512 byte granularity, while large requests (up to 2MiB) have a 62KiB granularity.
If you have a suggestion for additional benchmark models I would be happy to add an implementation for it.
Regarding the files, only rpmalloc.[h|c] is needed. The malloc.c file is just for overriding the malloc family of entry points, and provide automatic init/fini glue.
The 16 byte alignment is just a note that all returned blocks are naturally aligned to 16 byte boundaries due to the fact that all size buckets are a multiple of 16 bytes internally. It is needed for SSE instructions, which is why I mention it.
(Btw, I'm the author of the library)