Hoard The Hoard memory allocator is a very fast, memory-efficient and scalable memory allocator
Download

Hoard Ranking & Summary

Hoard Tags

memory memory footprint memory tester graphical memory more memory in-memory Memory Buffer memory register longterm memory Eiden memory memory book Memory Dump icom memory memory editor edit memory memory loader allocate memory ensurer memory freed correctly Memory Store Swift Allocator consumed memory tester Memory Temperature Memory Aanalyst memory dumps Optmize Memory read memory memory benchmark benchmark memory memory subsystem memory diagnostic memory content transceiver memory memory level memory setter set memory Memory Defragmentation clean memory memory analysis analyze memory memory defragger allocate memory memory tweaker extra memory increese memory memory diagnosis Memory Setting memmory allocator malloc replacement malloc alternative hoard allocator malloc Release memory memory profile memory watcher memory uasge internal memory Memory utilization Memory Stream Memory Viewer enhance memory Memory AddIn memory programming memory chip catalogue calculate memory use memory use graphic memory memory stresser Watch Memory Expanded Memory write memory memory allocator memory allocate memory bits memory bytes memory c# memory mapping paging memory living memory for memory holdem memory moving memory rotate memory memory 2 memory edit memory helper aural memory musical memory improving your memory memory improvement Photographic Memory Memory development phenomenal memory. memory Tweaking get memory memory washer clean up memory memory release dodje memory memory defragmantation cleaning memory lack of memory Memory problems insufficient memory

Hoard Description

The Hoard memory allocator is a very fast, memory-efficient and scalable memory allocator. Hoard runs on a variety of platforms, including Linux, Solaris, and Windows. Hoard is a drop-in replacement for malloc() that can dramatically improve application performance, especially for multithreaded programs running on multiprocessors. No change to your source is necessary. Just link it in or set just one environment variable. Multithreaded programs often do not scale because the heap is a bottleneck. When multiple threads simultaneously allocate or deallocate memory from the allocator, the allocator will serialize them. Programs making intensive use of the allocator actually slow down as the number of processors increases. Your program may be allocation-intensive without you realizing it, for instance, if your program makes many calls to the C++ Standard Template Library (STL). False Sharing The allocator can cause other problems for multithreaded code. It can lead to false sharing in your application: threads on different CPUs can end up with memory in the same cache line, or chunk of memory. Accessing these falsely-shared cache lines is hundreds of times slower than accessing unshared cache lines. Blowup Multithreaded programs can also lead the allocator to blowup memory consumption. This effect can multiply the amount of memory needed to run your application by the number of CPUs on your machine: four CPUs could mean that you need four times as much memory. Hoard is a fast allocator that solves all of these problems.

Hoard Related Software