[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Re: Bug#430140: ITP: hoard -- Fast, scalable, and efficient replacement memory allocator

Steve Greenland <steveg@moregruel.net> writes:

> 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
> sorted :-)

There is that too.  :)  Hoard is particularly good for applications that
are either multithreaded or that allocate memory once and then use it
frequently.  Applications that don't fit either of those profiles may see
little benefit.  I don't know if there are pathological cases; I've
personally only used it with OpenLDAP.

Russ Allbery (rra@debian.org)               <http://www.eyrie.org/~eagle/>

Reply to: