This release fixes a serious bug caused by the newest version of
libc (2.1.2, included with Red Hat 6.1). A call to malloc() inside
of atexit resulted in deadlock. I’ve now included a patched version
of atexit that solves this problem.
Announcing release 1.3.1 of Hoard, a fast, scalable and
memory-efficient allocator for multithreaded applications on
multiprocessors. Hoard solves the heap contention problem caused
when multiple threads simultaneously call malloc() and free() (or
new and delete).
Hoard scales linearly up to at least 14 processors and has
guaranteed bounds on memory consumption. You can use Hoard without
changing any of your source code: just link it in. Linking with
Hoard can result in a *dramatic* speedup of your application.
Supported systems include Linux, Solaris, IRIX (with pthreads
and sproc support), Windows NT, and with this release, the
BeOS.
Hoard is distributed under the Lesser GNU Public License, so you
may freely distribute any application linked with Hoard. You can
download Hoard from the Hoard home page:
http://www.cs.utexas.edu/users/emery/hoard
— Emery
—
Emery Berger
emery@cs.utexas.edu
http://www.cs.utexas.edu/users/emery
Parallel Programming
& Multiprogramming MP Groups
University of Texas at Austin