Re: [PATCH] Decrease hash table memory overhead

From: Matthew Wilcox (
Date: Fri Aug 04 2000 - 10:11:54 EST

On Mon, Jul 31, 2000 at 09:13:07PM +0100, Alan Cox wrote:
> > the best thing to do is shorten your hash chains. use a bigger hash
> > table, a hash function that randomizes better, or a better bucket data
> > structure.
> >
> > executive summary: LRU buckets ain't worth it.
> They are sometimes. You can easily profile to find those cases. Networking
> has some for example. In generally though I agree

Mach uses splay trees for many things. these are basically LRU trees
instead of LRU lists. i don't think they're a good idea because it
means you have to take a write lock instead of a read lock when you're
searching for things.

Revolutions do not require corporate support.

- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to Please read the FAQ at

This archive was generated by hypermail 2b29 : Mon Aug 07 2000 - 21:00:13 EST