Re: Bug#430140: ITP: hoard -- Fast, scalable, and efficient replacement memory allocator
On 24-Jun-07, 17:46 (CDT), "Steinar H. Gunderson" <firstname.lastname@example.org> wrote:
> On Fri, Jun 22, 2007 at 09:27:49AM -0700, Russ Allbery wrote:
> > Hoard is a replacement memory allocator that can be used instead of glibc
> > malloc without recompiling binaries. It is faster and more efficient
> > under many load patterns than the default glibc malloc, and is particularly
> > good for multithreaded programs running on multiple processors.
> What's the downsides? I'd guess that if it's GPLed and not in glibc, there's
> a catch somehow.
Without having any knowledge of the specifics of hoard, the phrase
"faster and more efficient under many load patterns" does not eliminate
the possibility of "pathologically horrible behaviour under other load
patterns". Bubble sort works pretty well if the input data is already
The irony is that Bill Gates claims to be making a stable operating
system and Linus Torvalds claims to be trying to take over the
world. -- seen on the net