a fast, scalable and memory-efficient allocator for multiprocessors. Hoard solves the heap contention problem caused when multiple threads call dynamic memory allocation functions like malloc() and free() (or new and delete).
J. Lee, K. Patel, N. Nigania, H. Kim, und H. Kim. Parallel and Distributed Processing Symposium Workshops PhD
Forum (IPDPSW), 2013 IEEE 27th International, Seite 1177--1185. (Mai 2013)
J. Shen, J. Fang, H. Sips, und A. Varbanescu. Parallel Processing Workshops (ICPPW), 2012 41st International
Conference on, Seite 116--125. ieeexplore.ieee.org, (2012)