Hoard memory allocator: Difference between revisions

Revision as of 20:35, 4 June 2007

Revision as of 13:52, 11 November 2007

Line 1:

{{unreferenced|date=August 2006}}

The '''Hoard memory allocator''', or '''Hoard''', is a [[memory allocation|memory allocator]] for [[Linux]], [[Solaris (operating system)|Solaris]], [[Microsoft Windows]] and other [[operating systems]]. Hoard can improve the performance of [[multithreaded]] applications by providing fast, [[scalable]] [[memory management]] functions ([[malloc]] and [[Free (programming)|free]]). In particular, it reduces contention for the heap (the central data structure used in [[dynamic memory allocation]]) caused when multiple threads allocate or free memory, and avoids the '''[[false sharing''']] that can be introduced by memory allocators. At the same time, Hoard has low [[fragmentation (computer)|fragmentation]].

==External links==