| Subject: | Re: Bug#430140: ITP: hoard -- Fast, scalable, and efficient replacement memory allocator |
|---|---|
| From: | Russ Allbery <rra@xxxxxxxxxx> |
| Date: | Mon, 25 Jun 2007 07:40:07 +0200 |
| Newsgroups: | linux.debian.devel |
Steve Greenland <steveg@xxxxxxxxxxxxx> 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@xxxxxxxxxx) <http://www.eyrie.org/~eagle/> -- To UNSUBSCRIBE, email to debian-devel-REQUEST@xxxxxxxxxxxxxxxx with a subject of "unsubscribe". Trouble? Contact listmaster@xxxxxxxxxxxxxxxx |
| Previous by Date: | Re: Bug#430140: ITP: hoard -- Fast, scalable, and efficient replacement memory allocator, Russ Allbery |
|---|---|
| Next by Date: | Re: Proposed new release goal: Dependency/file list predictability, Marcus Better |
| Previous by Thread: | Re: Bug#430140: ITP: hoard -- Fast, scalable, and efficient replacement memory allocator, Steve Greenland |
| Next by Thread: | Wir wissen was Frauen wollern, Wayne Crosby |
| Indexes: | [Date] [Thread] [Top] [All Lists] |