On Sat, Jun 19, 2010 at 12:04:06AM +0200, Edward Shishkin wrote: > Chris Mason wrote: > >On Fri, Jun 18, 2010 at 09:29:40PM +0200, Edward Shishkin wrote: > >>Jamie Lokier wrote: > >>>Edward Shishkin wrote: > >>>>If you decide to base your file system on some algorithms then please > >>>>use the original ones from proper academic papers. DO NOT modify the > >>>>algorithms in solitude: this is very fragile thing! All such > >>>>modifications must be reviewed by specialists in the theory of > >>>>algorithms. Such review can be done in various scientific magazines of > >>>>proper level. > >>>> > >>>>Personally I don't see any way to improve the situation with Btrfs > >>>>except full redesigning the last one. If you want to base your file > >>>>system on the paper of Ohad Rodeh, then please, use *exactly* the > >>>>Bayer's B-trees that he refers to. That said, make sure that all > >>>>records you put to the tree has equal length and all non-root nodes of > >>>>your tree are at least half filled. > >>>First, thanks Edward for identifying a specific problem with the > >>>current btrfs implementation. > >>Hello Jamie. > >> > >>>I've studied modified B-trees quite a lot and know enough to be sure > >>>that they are quite robust when you modify them in all sorts of ways. > >>Which property is robust? > >> > >>>Moreover, you are incorrect to say there's an intrinsic algorithmic > >>>problem with variable-length records. It is not true; if Knuth said > >>>so, Knuth was mistaken. > >>I didn't say about intrinsic algorithmic problems :) > >>I just repeat (after Knuth et al) that B-trees with variable-length > >>records don't > >>have any sane boundary for internal fragmentation. The common idea > >>is that if we > >>don't want Btrfs to be in infinite development stage, then we should > >>choose some > >>*sane* strategy (for example the paper of Ohad Rodeh) and strictly > >>adhere this in > >>future. > > > >Again, other than the inline file data, what exactly do you believe > >needs to change? > > 1. getting rid of inline extents; > 2. new formats for directory and xattr items to not look like a train, > which is able to occupy the whole leaf; > 3. make sure we do pro-active balancing like it is described in the paper. > > Sorry, I don't see other ways for now.. > > > Top down balancing vs balancing on insertion doesn't > >impact our ability to maintain full leaves. The current code is clearly > >choosing not to merge two leaves that it should have merged, which is > >just a plain old bug. > > How are you going to balance leaves when walking from top to down? > Suppose 1) and 2) above are not satisfied and having arrived to the leaf > level we see a number of items of variable length. What will we do to > keep leaves full? I think I'm mixing up complaints ;) top-down balancing is unrelated to the variable length items. You could balance from the bottom up and if you have a 1K item that can't be split next to a 3K item that can't be split, we're going to have those two items in two leaves. This is true regardless of how we balance. So the prime complaint here is that you don't like variable length items, correct? Ideally leaves are full, and ideally data blocks are full. In practice we can end up with either one utilized less than we would like. At the end of the day, every FS has a worst case setup where it is mostly empty in terms of bytes stored but full in terms of blocks. On xfs: for x in `seq 1 bazallion` ; echo 'f' > $x This would work on ext4 too, until you ran out of inodes. > > Could you please provide a sketch of the algorithm? > I'll reproduce from your test case and provide a fix. mount -o max_inline=1500 would give us 50% usage in the worst case (minus the balancing bug you hit). -chris -- To unsubscribe from this list: send the line "unsubscribe linux-fsdevel" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
