Jörn Engel wrote:Please, lets refrain form unfair comparisons like this before logfs is finished. Also, when you compare, please, take into account that UBI/UBIFS has many times more commentaries in the code. I asked you some time ago to describe how you maintain per-eraseblock space accounting [1]. E.g., how you select an eraseblock for garbage collection, how do you store the accounting information. You said you find eraseblocks by scanning. This means logfs is not really scalable because you may spend ages before you find anything appropriate. When the FS is almost full, yo need to scan nearly whole flash to find an eraseblock? So if I mount a nearly full FS, and start writing, I'll get my request handled when nearly whole media is scanned? UBIFS stores per-eraseblock information on the media in a B-tree, and it also has lists of empty/dirty eraseblocks, which allow to very quickly find the best eraseblock to garbage-collect or to write to. [1] http://lkml.org/lkml/2007/8/8/333 -- Best Regards, Artem Bityutskiy (Артём Битюцкий) --
| Linus Torvalds | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Artem Bityutskiy | [RFC PATCH 06/26] UBIFS: add superblock and master node |
| Joe Perches | [PATCH 001/148] include/asm-x86/acpi.h: checkpatch cleanups - formatting only |
| Linus Torvalds | Re: LSM conversion to static interface |
git: | |
| Alexey Dobriyan | Re: [GIT]: Networking |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| Christoph Lameter | Network latency regressions from 2.6.22 to 2.6.29 |
