Re: [PATCH] Decrease hash table memory overhead

From: Mark Hahn (hahn@coffee.psychology.mcmaster.ca)
Date: Fri Aug 04 2000 - 11:45:02 EST


> 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.

easy to make it lazy by doing the update only when the lock's uncontended.

-
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/



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