It costs US$9.95 and requires Mac OS X 10.5.8 or higher. Here’s how the game is described: “Every action you take will have an effect on your score in this ‘stratecade’ game that 1UP observes “hides a surprising layer of complexity and strategy.”. Who is Squiddershins? Squiddershins is a game dev duo from SoCal. They have been making interactive whimsy since 2009. The Hoard algorithm also serves as the basis for the Mac OS X Memory Manager. Berger received a PhD in Computer Science from the University of Texas at Austin in 2002. His honors include receiving a Microsoft Research Fellowship, an NSF CAREER Award, and a Lilly Teaching Fellowship, among others.
Hoard is a memory manager enhancing malloc function for multi-threaded softwares. It is designed to replace transparently the default system malloc.
This howto is tested on :
This howto is tested with these versions of Hoard :
Install the needed softwares :
Download the software latest version:
Go to the sources folder :
Detect the system architecture :
Compile the software version fitting the system architecture :
Install the software :
Exit the sources folder :
Delete the downloaded files :
Use Hoard to optimize a given software (replace /usr/bin/software by the optimized command):
If wished, setup the system to use Hoard as default memory manager (dangerous, reboot needed) :
Original author(s) | Emery Berger, Kathryn S. McKinley, Robert D. Blumofe, Paul R. Willson |
---|---|
Developer(s) | Emery Berger |
Initial release | September 29, 1999 |
Stable release | |
Operating system | Linux, OS X, Microsoft Windows |
Available in | C++ |
Type | Memory allocation |
License | Apache License v2 |
Website | hoard.org |
The Hoard memory allocator, or Hoard, is a memory allocator for Linux, OS X, and Microsoft Windows. 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, scalablememory 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. At the same time, Hoard has strict bounds on fragmentation.[1]
Hoard continues to be maintained and improved, and is in use by a number of open source and commercial projects.[2][3]
It has also inspired changes to other memory allocators such as the one in OS X since February 2008 (first released in Mac OS X Snow Leopard).[4][5]