On Wed, Oct 24, 2012 at 5:03 PM, <david@xxxxxxx> wrote: > I'm doing some work with rsyslog and it's disk-baded queues and there is a > similar issue there. The good news is that we can have a version that is > linux specific (rsyslog is used on other OSs, but there is an existing queue > implementation that they can use, if the faster one is linux-only, but is > significantly faster, that's just a win for Linux) > > Like what is being described for sqlite, loosing the tail end of the > messages is not a big problem under normal conditions. But there is a need > to be sure that what is there is complete up to the point where it's lost. > > this is similar in concept to write-ahead-logs done for databases (without > the absolute durability requirement) > > [...] > > I am not fully understanding how what you are describing (COW, separate > fsync threads, etc) would be implemented on top of existing filesystems. > Most of what you are describing seems like it requires access to the > underlying storage to implement. > > could you give a more detailed explination? COW is "copy on write", which is actually a bit of a misnomer -- all COW means is that blocks aren't over-written, instead new blocks are written. In particular this means that inodes, indirect blocks, data blocks, and so on, that are changed are actually written to new locations, and the on-disk format needs to handle this indirection. As for fsyn() and background threads... fsync() is synchronous, but in this scheme we want it to happen asynchronously and then we want to update each transaction with a pointer to the last transaction that is known stable given an fsync()'s return. Nico -- -- 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
