lkml.org 
[lkml]   [2009]   [Jan]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: [PATCH] add b+tree library
    On Sat, 10 January 2009 16:27:40 -0500, Theodore Tso wrote:
    > On Sat, Jan 10, 2009 at 09:23:16PM +0100, Jörn Engel wrote:
    > >
    > > Key difference is the number of cachelines you need to find a particular
    > > entry. rbtrees have a fanout of sqrt(3), so for a million elements (to
    > > pick a random example) you need about 25 cachelines with rbtrees and
    > > about 5-16 with btrees. Closer to 5 if keys and pointers are small and
    > > cachelines are large, closer to 16 if keys and pointers are large and
    > > cachelines are small.
    >
    > Three questions.... is the number of cachelines in use going to make a
    > measurable difference for your use case in the filesystem? If the
    > operation is going to involve disk access, trying to optimize for to
    > improve cacheline utilization may not be the higher priority thing to
    > worry about.

    I don't really expect a big difference, even if the filesystem is
    intended for flash, not disks. Other overhead will dominate the
    picture. The situation may be different for Johannes, though.

    > If you have a million elements, and assuming each element is but 4
    > bytes (which seems unlikely; very likely you'd be indexing at least
    > 8-12 bytes of data, right?) we're talking about 4 megabytes of
    > non-swappable kernel memory. Is that likely to be happen in your use
    > case?

    A million was picked because a) it is easy to calculate with and b) it
    is sufficiently (insanely) large to illustrate the effect. It is not
    likely at all in my case. With 1000 elements, which is much more
    realistic, you can just halve the numbers above.

    > Finally, are b+tree so much better than rbtrees that it would be
    > worthwhile to just *replace* rbtrees with b+trees? Or is the problem
    > the overhead issue if the number of entries in an rbtree is relatively
    > small?

    Maybe and no. The overhead for near-empty or completely empty trees is
    fairly low. At one point in time I had one btree for every indirect
    block and every inode in the filesystem. As a result, struct btree_head
    contains just two pointers and an int.

    One key difference is that rbtrees maintain the tree within objects and
    btrees maintain the tree externally. So btrees have to allocate memory
    on insertion, where rbtrees have the necessary memory as part of the
    object. With mempools the memory allocation should be reasonably safe,
    so maybe this is a bit of a red herring now.

    Another difference is the locking. The current implementation
    completely ignores locking and depends on the callers to serialize
    access to the btree.

    Keeping all that in mind, I believe many rbtree users could be
    converted.

    Jörn

    --
    The competent programmer is fully aware of the strictly limited size of
    his own skull; therefore he approaches the programming task in full
    humility, and among other things he avoids clever tricks like the plague.
    -- Edsger W. Dijkstra
    --
    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: 2009-01-10 23:05    [W:0.032 / U:59.800 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site