[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20081007.140645.119998645.davem@davemloft.net>
Date: Tue, 07 Oct 2008 14:06:45 -0700 (PDT)
From: David Miller <davem@...emloft.net>
To: npiggin@...e.de
Cc: hch@...radead.org, linux-kernel@...r.kernel.org,
linux-mm@...ck.org, netdev@...r.kernel.org, paulmck@...ibm.com
Subject: Re: [patch][rfc] ddds: "dynamic dynamic data structure" algorithm,
for adaptive dcache hash table sizing (resend)
From: Nick Piggin <npiggin@...e.de>
Date: Tue, 7 Oct 2008 09:53:09 +0200
> Dcache lookup is partially a tree lookup, but also how do you look up
> entries in a given directory? That is not naturally a tree lookup. Could
> be a per directory tree, though, or a hash, or trie.
>
> Anyway, I don't volunteer to change that just yet ;)
Historically speaking, the original dcache by Thomas Schoebel-Theuer
(circa 1997) was in fact implemented as a per-directory hash table.
This has all kinds of recursion and other issues, which is why Linus
eventually changed it to use a global hash table scheme.
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists