Re: big flash disks?

Jamie Lokier
2008-06-02T12:48:24Z

Jörn Engel wrote:
> On Mon, 2 June 2008 11:41:06 +0100, Jamie Lokier wrote:
> >
> > Won't you get essentially the same by creating a single file on LogFS,
> > and using it for a loopback mount?
>
> In a broad sense, yes. Drawbacks of this setup are the usual ones of
> loop plus a deeper tree for logfs. Instead of having a single 'file'
> with indirect blocks, you also have the inode file with indirect blocks.
> So for every sync, another couple of writes are necessary that don't
> give you any gains in such a setup.

Oh. I've been thinking a lot about log-structured trees (or
tree-structured logs :-) lately, so I tend to assume the tree depth
isn't important, when nodes close to the root are static.

Did you know you can structure the tree such that additional depth
doesn't add many/any additional writes on sync?

The basic idea is for a pointer in a tree node to point not to one
child, but to a small set of potential children. The child-set are a
journal in the jffs2 sense. When reading, you read each block of the
child-set, and pick the most recent. This slows down reading, but
reduces the amount of writing. You still read in O(log tree_size)
blocks, and since most of the extra reads are hot-cache internal tree
blocks, the amount of extra reading is quite small. Child-sets can
overlap to reduce storage duplication, at cost of more operations -
it's a heuristic balancing act. Child-sets are not used for all tree
nodes, especially data. They can be invoked and destroyed dynamically
using heuristics to detect some parts of the tree undergoing lots of
write+sync sequences and others being coalescable writes or not
written.

Put simply: combine logging with phase trees, and you won't have to
replace the whole leaf-to-root path on every sync. Then extra static
depth at the root is free.

-- Jamie