lkml.org 
[lkml]   [2002]   [Jan]   [29]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: [PATCH] Radix-tree pagecache for 2.5
    On Tue, 29 Jan 2002, Linus Torvalds wrote:
    > On Tue, 29 Jan 2002, David S. Miller wrote:
    > >
    > > I like the changes too, but I'd like to see some numbers
    > > as well.
    >
    > Absolutely. Even something as simplistic as "lmbench file re-read" changed
    > by 0.1% or something. I definitely believe in the scalability part (as
    > long as the different processes don't all touch the same mapping all the
    > time), so I'm more interested in the "what is the impact of the hash chain
    > lookup/walk vs the radix tree walk" kinds of numbers.

    There's another nice advantage to the radix tree.

    We can let oracle shared memory segments use 4 MB pages,
    but still use the normal page cache code to look up the
    pages.

    With a radix tree there is no overhead in using different
    page sizes since we'll just run into them in the tree.

    (as opposed to the horrors of trying a hash lookup with
    multiple page orders)

    regards,

    Rik
    --
    "Linux holds advantages over the single-vendor commercial OS"
    -- Microsoft's "Competing with Linux" document

    http://www.surriel.com/ http://distro.conectiva.com/

    -
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to majordomo@vger.kernel.org
    More majordomo info at http://vger.kernel.org/majordomo-info.html
    Please read the FAQ at http://www.tux.org/lkml/

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