Hoard memory allocator: Difference between revisions

Revision as of 10:56, 9 May 2014

Revision as of 02:23, 22 May 2015

Line 30:

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 doi|10.1145/378993.379232}}</ref>

In 2004, Maged Michael implemented a new memory allocator and benchmarked it with Hoard and some other famous memory allocators. He stated its new memory allocator is more efficient than Hoard.<ref name=Maged2003>{{cite doi|10.1145/996841.996848}}</ref> Then Maged Michael contributed to improve Hoard's quality.<ref>See THANKS file in source code</ref>

Hoard continues to be maintained and improved, and is in use by a number of open source and commercial projects.<ref>{{cite web |title=An alternative Memory Allocator for the standard glibc |date=2007-09-16 |url=http://ineluttabile.it/node/6 |archiveurl=http://web.archive.org/web/20111007180846/http://ineluttabile.it/node/6 |archivedate=2011-10-07}}</ref><ref>{{cite web |title=GNU Common C++ Downloading |url=http://www.gnutelephony.org/index.php?title=GNU_Common_C%2B%2B&oldid=1105#Downloading}}</ref>