On Tue, Jun 03, 2014 at 07:30:32AM +0200, Christian Stroetmann wrote: > In general, I do not believe that the complexity problems of soft updates, > atomic writes, and related techniques can be solved by hand/manually. So my > suggestion is to automatically handle the complexity problem of e.g. > dependancies in a way that is comparable to a(n on-the-fly) file-system > compiler so to say that works on a very large dependancy graph (having > several billions of graph vertices actually). And at this point an > abstraction like it is given with Featherstitch helps to feed and control > this special FS compiler. Well, if you want to try to implement something like this, go for it! I'd be very curious to see how well (a) how much CPU overhead it takes to crunch on a dependency graph with billions of vertices, and (b) how easily can it be to express these dependencies and maintainable such a dependency language would be. Sounds like a great research topic, and I'll note the Call For Papers for FAST 2015 is out, and if you can solve these problems, it would make a great FAST 2015 submission: https://www.usenix.org/conference/fast15/call-for-papers Cheers, - Ted -- 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
