|From:||Ivan Voras <ivoras@xxxxxxxxxxx>|
|Date:||Thu, 07 Feb 2008 01:05:23 +0100|
* Get rid of the A-list's (the recursive bitmap radix tree allocation model). Poof, gone. All of them, gone. Have no random block allocation model at all.
* Get rid of the per-cluster B-Tree's. Instead have just one global B-Tree for the entire filesystem, able to access any record anywhere in the filesystem (currently a per-cluster B-Tree can only access information within that cluster).
* Implement the filesystem as one big huge circular FIFO, pretty much laid down linearly on disk, with a B-Tree to locate and access data.
Description: OpenPGP digital signature