Hoard
hoard
http://www.cs.umass.edu/~emery/hoard/
Hoard is a fast, scalable and memory-efficient allocator for multiprocessors. It solves the heap contention problem caused when multiple threads call dynamic memory allocation functions like malloc() and free() (or new and delete), and can dramatically improve the performance of multithreaded programs running on multiprocessors. it is a drop-in replacement for malloc(), etc., so you don't have to change your source code.
Related Projects
Licensing
| License | Verified by | Verified on | Notes |
|---|---|---|---|
| GPL | Janet Casey | 11 July 2001 |
Leaders and contributors
| Contact(s) | Role |
|---|---|
 Emery Berger | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Help | mailto:hoard-announce@egroups.com | |
| Support | mailto:hoard@egroups.com |
Software prerequisites
| Kind | Description |
|---|---|
| Required to use | pthread |
This entry (in part or in whole) was last reviewed on 13 December 2004.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.