free society. We build this foundation.
With your help, we will raise $450,000 this
winter to make this foundation even stronger.
Donate today, and build us up for 2014.
Hoard is a fast, scalable and memory-efficient allocator for multiprocessors. It solves the heap contention problem caused when multiple threads call dynamic memory allocation functions like malloc() and free() (or new and delete), and can dramatically improve the performance of multithreaded programs running on multiprocessors. it is a drop-in replacement for malloc(), etc., so you don't have to change your source code.
released on 13 December 2004
|License||Verified by||Verified on||Notes|
|GPL||Janet Casey||11 July 2001|
Leaders and contributors
Resources and communication
|Required to use||pthread|
This entry (in part or in whole) was last reviewed on 13 December 2004.