lkml.org 
[lkml]   [2000]   [Aug]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH] Decrease hash table memory overhead
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 majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:58    [W:0.615 / U:0.176 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site