On Feb 23, 2007, at 7:37 AM, Nick Piggin wrote:
The dentry hash uses up 8MB for 1 million entries on my 4GB system
is one
of the biggest wasters of memory for me. Because I rarely have more
than one or
two hundred thousand dentries. And that's with several kernel trees
worth of
entries. Most desktop and probably even many types of servers will
only use a
fraction of that.
So I introduce a new method for resizing hash tables with RCU, and
apply
that to the dentry hash.
Can you compare what you've done to the design that Paul and David
talked about a year ago?
http://lkml.org/lkml/2006/1/30/74
I'd love to see a generic implementation of RCU hashing that
subsystems can then take advantage of. It's long been on the fun
side of my todo list. The side I never get to :/.
- z
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
