Hoard memory allocator
| Original author(s) | Emery Berger Kathryn S. McKinley Robert D. Blumofe Paul R. Willson |
|---|---|
| Developer(s) | Emery Berger |
| Initial release | September 29, 1999 |
| Stable release |
3.11 / August 5, 2015
|
| Development status | Active |
| Operating system | Linux, OS X, Microsoft Windows, Solaris and others |
| Platform | Cross-platform |
| Available in | C++ |
| Type | Memory allocation |
| License | GPL v2 and another one for proprietary software |
| Website | www |
The Hoard memory allocator, or Hoard, is a memory allocator for Linux, Solaris, Microsoft Windows and other operating systems. Hoard is designed to be efficient when used by multithreaded applications on multiprocessor computers. Hoard is distributed under the GPL, but can be purchased for proprietary software.
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). 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.
Hoard continues to be maintained and improved, and is in use by a number of open source and commercial projects.
It has also inspired changes to other memory allocators such as the one in OS X since February 2008 (first released in Mac OS X Snow Leopard).
...
Wikipedia