[lkml]   [2008]   [Oct]   [7]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [patch][rfc] ddds: "dynamic dynamic data structure" algorithm, for adaptive dcache hash table sizing (resend)
    From: Nick Piggin <>
    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.

     \ /
      Last update: 2008-10-07 23:09    [W:0.039 / U:5.620 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site