In today's world, Hoard memory allocator has become a topic of great relevance and debate. Since its origin, Hoard memory allocator has impacted people's lives in various ways, generating conflicting opinions and divergent positions. Its influence has transcended borders and has marked a before and after in the history of humanity. Over time, Hoard memory allocator has been the object of study, analysis and reflection, and its importance has not stopped growing. In this article, we will explore the different facets of Hoard memory allocator, analyzing its impact on current society and its projection in the future.
Original author(s) | Emery Berger, Kathryn S. McKinley, Robert D. Blumofe, Paul R. Wilson |
---|---|
Developer(s) | Emery Berger |
Initial release | September 29, 1999 |
Stable release | 3.13
/ January 1, 2019 |
Repository | |
Operating system | Linux, OS X, Microsoft Windows |
Available in | C++ |
Type | Memory allocation |
License | Apache License v2 |
Website | hoard |
The Hoard memory allocator, or Hoard, is a memory allocator for Linux, OS X, and Microsoft Windows. Hoard is designed to be efficient when used by multithreaded applications on multiprocessor computers. Hoard is distributed under the Apache License, version 2.0.
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).