Hoard memory allocator: Difference between revisions

Revision as of 16:22, 8 October 2009

Revision as of 17:04, 10 November 2009

Line 43:

}}</ref><ref>above PDF freely available at http://www.cs.umass.edu/~emery/hoard/asplos2000.pdf</ref>.

In 2004, Michael 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 journal

| author = Maged M. Michael

| coauthors = Thomas, J. Waston

Line 55:

| accessdate =

| doi = 10.1145/996841.996848

}}</ref><ref>above PDF freely available at http://www.research.ibm.com/people/m/michael/pldi-2004.pdf</ref>. Then Michael Maged Michael contributed to improve Hoard's quality<ref>See THANKS file in source code</ref>.

Nowadays, Hoard is still maintained and improved and softwares rely on it<ref>[http://ineluttabile.it/node/6 Toffanin Mauro's blog] Commercial [[Linux distribution]]s may use '''Hoard''' instead of [[GNU libc]]</ref><ref>[http://www.gnutelephony.org/index.php/GNU_Common_C%2B%2B#Downloading_and_Documentation GNU Telephony] GNU Common C++ uses lib'''hoard'''</ref>.