Difference between revisions of "Hoard"

From Free Software Directory
Jump to: navigation, search
(Created page with "{{Entry |Name=hoard |Short description=Memory allocator for multiprocessors |Full description=Hoard is a fast, scalable and memory-efficient allocator for multiprocessors. It sol...")
(No difference)

Revision as of 09:13, 12 April 2011


[edit]

hoard

http://www.hoard.org/
Memory allocator for multiprocessors

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.





Licensing

License

Verified by

Verified on

Notes

License

GPL

Verified by

Janet Casey

Verified on

11 July 2001




Leaders and contributors

Contact(s)Role
Emery Berger Maintainer


Resources and communication

AudienceResource typeURI
Ruby (Ref)https://rubygems.org/gems/hoard
Python (Ref)https://pypi.org/project/hoard
HelpE-mailmailto:hoard-announce@egroups.com
SupportE-mailmailto:hoard@egroups.com


Software prerequisites

KindDescription
Required to usepthread




Entry



















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 or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.