There already is a benchmark against glibc single threaded, compile the rpmalloc-benchmark repository linked in the readme and run the runall script. Compare rp

There already is a benchmark against glibc single threaded, compile the rpmalloc-benchmark repository linked in the readme and run the runall script. Compare rpmalloc 1 thread case against crt 1 thread (with crt being the C runtime, i.e glibc in this case). 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.