Hoard memory allocator: Difference between revisions

Revision as of 23:24, 24 September 2010

Revision as of 04:39, 16 November 2010

Line 25:

}}

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 is designed to be efficient when used by [[Multithreading (computer architecture)|multithreaded]] applications on [[multiprocessor]] computers. Hoard is distributed under the [[GPL]], but can be purchased for [[proprietary software]].

==History==

In 2000, its author [[Emery Berger]] benchmarked some famous memory allocators and stated Hoard improves 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 strict bounds on [[fragmentation (computer)|fragmentation]]<ref name=Berger2000>{{cite journal

| author = Berger, E.D.

| coauthors = McKinley, K.S.; Blumofe, R.D.; Wilson, P.R.