Matthew Dillon wrote:

quoted text
>     * Get rid of the A-list's (the recursive bitmap radix tree allocati=
on
quoted text
>       model).  Poof, gone.  All of them, gone.  Have no random block
>       allocation model at all.
>=20
>     * Get rid of the per-cluster B-Tree's.  Instead have just one globa=
l
quoted text
>       B-Tree for the entire filesystem, able to access any record anywh=
ere
quoted text
>       in the filesystem (currently a per-cluster B-Tree can only access=

quoted text
>       information within that cluster).
>=20
>     * Implement the filesystem as one big huge circular FIFO, pretty mu=
ch
quoted text
>       laid down linearly on disk, with a B-Tree to locate and access da=
ta.

How will this affect parallel IO (reads, but especially writes)? Would=20
having such a global structure serialize it? (I'm assuming, possibly=20
wrongly, that having trees per-cluster allowed you to lock individual=20
clusters).