Hoard memory allocator
 | This article contains weasel words: vague phrasing that often accompanies biased or unverifiable information. (March 2009) |
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
- ^ Berger, E.D. (2000). "Hoard: a scalable memory allocator for multithreaded applications". ACM SIGPLAN Notices. 35 (11): 117–128. Retrieved 2008-01-06.
{{cite journal}}: Unknown parameter|coauthors=ignored (|author=suggested) (help)
External links
- 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.
 | This Microsoft Windows software-related article is a stub. You can help Wikipedia by expanding it. |
 | This Linux-related article is a stub. You can help Wikipedia by expanding it. |