TheHoard memory allocator, orHoard, is amemory allocator forLinux,OS X, andMicrosoft Windows. Hoard is designed to be efficient when used bymultithreaded applications onmultiprocessor computers. Hoard is distributed under theApache License, version 2.0.

In 2000, its authorEmery Berger benchmarked some famous memory allocators and stated Hoard improves the performance of multithreaded applications by providing fast,scalablememory management functions (malloc andfree). In particular, it reduces contention for the heap (the central data structure used indynamic memory allocation) caused when multiple threads allocate or free memory, and avoids thefalse sharing that can be introduced by memory allocators. At the same time, Hoard has strict bounds onfragmentation.^[1]

Hoard continues to be maintained and improved, and is in use by a number of open source and commercial projects.^[2][3]

It has also inspired changes to other memory allocators such as the one inOS X since February 2008 (first released inMac OS X Snow Leopard).^[4][5]

• C dynamic memory allocation – Dynamic memory management in the C programming language
• Manual memory management – Computer memory management methodology
• Dynamic memory allocation – Computer memory management methodologyPages displaying short descriptions of redirect targets
• mimalloc – Microsoft open source library

• The Hoard web page.
• Emery Berger, Hoard's author and a professor at theUniversity of Massachusetts Amherst.

• Memory management
• Memory management software

• Articles with short description
• Short description matches Wikidata
• Pages displaying short descriptions of redirect targets via Module:Annotated link