Jump to content

Hoard memory allocator

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SmackBot (talk | contribs) at 16:41, 1 September 2008 (Add references section and/or general fixes.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Hoard memory allocator, or Hoard, is a memory allocator for Linux, 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). 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[1].

References

  1. ^ Cite error: The named reference Berger2000 was invoked but never defined (see the help page).
  • Berger, E.D. (2000). "Hoard: a scalable memory allocator for multithreaded applications". ACM SIGPLAN Notices. 35 (11): 117–128. doi:10.1145/356989.357000. Berger2000. Retrieved 2008-01-06. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
  • The Hoard web page.
  • Emery Berger, Hoard's author and a professor at the University of Massachusetts Amherst.
Stub icon

This Microsoft Windows software-related article is a stub. You can help Wikipedia by expanding it.

Stub icon

This Linux-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hoard_memory_allocator&oldid=235620169"