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.

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