A simple JFFS3 GC algorithm
havasi at inf.u-szeged.hu
Tue Mar 7 06:04:42 EST 2006
> Your proposal is based on a "map" which is basically a per-region
> table. This is unscalable solution. Do you have any other more
> scalable proposals? Let's for now consider this as a fall-back
> solution, OK?
If we don't work with regions smaller than 256K, than a size of the map
of a 16G flash is about 786K, which I think is still OK, and also can be
I know this is not the best solution, we suggested it only for the first
variant of JFFS3 because it may work well on recent flash chips and make
the garbage collection absolutelly transparent, and relatively easy to
implement - there is no serious locking problems.
> And, BTW, how are you going to build this "map" when you mount the
> file system?
It is stored on the flash somewhere (its position is in the superblock),
and the changes are logged into a separated journal. When this journal
is fulled, the new version of map will be written out. If the file
system is mounted the stored map will be loaded and the events stored in
the journal are replayed.
Anyway, we don't insist on this algorithm, it was only an idea, maybe
not usefull. We've started to implement a simplified user space
prototype of JFFS3, specially for testing different kind of garbage
More information about the linux-mtd