Hoard memory allocator
问题 Hoard memory allocator I'm reading papers about Hoard memory allocator, and everything is understandable, but one thing not, how it reduces contention for the heap caused when multiple threads allocate or free memory, after avoids the false sharing that can be introduced by memory allocators and at the same time, it applies strict bounds on fragmentation. How did they achieve it? 回答1: From the paper, Hoard allocates memory internally in superblocks as required by the per-processor heaps .