Not sure if `learn` is the right topic or not to post this..
I've been going through Bob Nystrom's "Crafting Interpreters" for
a bit of fun and over the weekend put together a toy allocator in
D - free and gc not yet done. It's single threaded and
unsurprisingly faster than malloc for small objects up to 512
bytes, and about the same for larger objects (simulated with a
linear distribution of size requests).
But I'd like to be able to benchmark it to see how I'm doing.
A colleague suggested I ask here for resources and pointers - I
was trying to find stats on malloc performance (internal and
external fragmentation, long running reuse, distributions of size
requests for testing and comparison, how to reason about
trade-offs of cache missing, branch misprediction, meta data,
etc).
So academic papers, books, blogs, experiences are all welcome,
especially with regard to optimising for immutability / COW -
would be welcome or even just some good ol' conversation.
