26 Jul 00:13
Re: Comparison to Hammer fs design
Daniel Phillips <phillips <at> phunq.net>
2008-07-25 22:13:58 GMT
2008-07-25 22:13:58 GMT
On Friday 25 July 2008 11:53, Matthew Dillon wrote: > > :Hi; > : > :The announcement of yet another filesystem: > : > :http://lkml.org/lkml/2008/7/23/257 > : > :led to some comments about hammer fs: > : > :http://tux3.org/pipermail/tux3/2008-July/000006.html > : > :enjoy, > : > : Pedro. > > Those are interesting comments. I think I found Daniel's email address > so I am adding him to the To: Dan, feel free to post this on your Tux > groups if you want. How about a cross-post? > I did consider multiple-parentage... that is the ability to have a > writable snapshot that 'forks' the filesystem history. It would be > an ultra cool feature to have but I couldn't fit it into the B-Tree > model I was using. Explicit snapshotting would be needed to make it > work, and the snapshot id would have to be made part of the B-Tree key, > which is fine. HAMMER is based around implicit snapshots (being able > to do an as-of historical lookup without having explicitly snapshotted > bits of the history).(Continue reading)
I will include the whole of the previous
posting so the DFly groups see the whole thing, if you continue to get
bounces.
I believe I have successfully added you as an 'alias address' to the
DragonFly kernel list so you shouldn't get bounced if you Cc it now.
:Yes, that is the main difference indeed, essentially "log everything" vs
:"commit" style versioning. The main similarity is the lifespan oriented
:version control at the btree leaves.
Reading this and a little more that you describe later let me make
sure I understand the forward-logging methodology you are using.
You would have multiple individually-tracked transactions in
progress due to parallelism in operations initiated by userland and each
would be considered committed when the forward-log logs the completion
of that particular operation?
If the forward log entries are not (all) cached in-memory that would mean
that accesses to the filesystem would have to be run against the log
first (scanning backwards), and then through to the B-Tree? You
would solve the need for having an atomic commit ('flush groups' in
HAMMER), but it sounds like the algorithmic complexity would be
very high for accessing the log.
RSS Feed