HOARD memory allocator

[Allan Stokes]

Hi guys,

This link came to my attention via a mathtools.net bulletin.

ftp://ftp.cs.utexas.edu/pub/emery/papers/asplos2000.pdf

>From the Abstract
<<
Hoard combines one global heap and per-processor heaps with a novel
discipline that provably bounds memory consumption and has very low
synchronization costs in the common case.  Our results on eleven programs
demonstrate that Hoard yields low average fragmentation and improves overall
program performance over the standard Solaris allocator by up to a factor of
60 on 14 processors, and up to a factor of 18 over the next best allocator
we tested.
>>

http://www.cs.utexas.edu/users/emery/hoard/

Available for download under the LGPL.

I noted in an earlier post that the Pooma pool allocator is not doing much
to consider cache line efficiency.  If we wish to revisit allocation
strategies at some point, it would be worth looking at the design of Hoard
in more detail.

Allan