A simple JFFS3 GC algorithm

[Artem B. Bityutskiy]

On Tue, 2006-03-07 at 12:04 +0100, Ferenc Havasi wrote:
> 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
> cached.
Providing this number is correct, indiid, not too much.

> 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.
Hmm. Could you please add more detailed description to your document
about how we could maintain this map on flash, that journal, etc?

> 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
> collecting methods.
> 
Cool!

-- 
Best Regards,
Artem B. Bityuckiy,
St.-Petersburg, Russia.