title: Hoard memory allocator
body: <p><a href="http://www.cs.umass.edu/~emery/hoard/asplos2000.pdf" rel="nofollow noreferrer">Hoard memory allocator</a></p>
  
  <p>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?</p>
  
  <p><img src="https://i.stack.imgur.com/1NWzx.jpg" alt="enter image description here"></p>