Hoard memory allocator: Difference between revisions

Revision as of 14:24, 5 May 2014

Revision as of 11:02, 7 May 2014

Line 22:

|genre = [[Memory allocation]]

|license = [[GNU General Public License|GPL]] v2 and another one for [[proprietary software]]

|website = {{URL|http://www.hoard.org/}}

}}

{{Portal|Free software}}

Line 29:

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

| author = Berger, E.D.

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

| year = 2000

| title = Hoard: a scalable memory allocator for multithreaded applications

| journal = Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS IX)

| volume = 35

| issue = 11

| pages = 117–128

| url = http://dl.acm.org/citation.cfm?doid=378993.379232

| accessdate = 2013-10-26

| doi = 10.1145/378993.379232

}}</ref><ref>above PDF freely available at http://www.cs.umass.edu/~emery/hoard/asplos2000.pdf</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 journaldoi|10.1145/996841.996848}}</ref> Then Maged Michael contributed to improve Hoard's quality.<ref>See THANKS file in source code</ref>

| author = Maged M. Michael

| coauthors = Thomas, J. Waston

| year = 2004

| title = Scalable Lock-Free Dynamic Memory Allocation

| journal = ACM SIGPLAN Notices

| volume = 39

| issue = 6

| pages = 35–46

| url = http://portal.acm.org/citation.cfm?id=996841.996848

| 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 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>{{Dead link|date=March 2012}}[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>