One feature of some of these is extents. They can use index, linked, or contiguous allocation. Fully journaled ones allow for optimal fault recovery, but many only journal metadata. Unix-like ones often use inodes and, like databases, arrange data using variations on B-trees. Commonly, their basic units are called clusters and blocks; if the units corresponding to a given item are scattered in one, that one is fragmented. They must be mounted before use. For 10 points, name these protocols for organizing data on storage devices like hard drives, examples of which include Reiser, ext2 and 3, and FAT.
One feature of some of these is extents. They can use index, linked, or contiguous allocation. Fully journaled ones allow for optimal fault recovery, but many only journal metadata. Unix-like ones often use inodes and, like databases, arrange data using variations on B-trees. Commonly, their basic units are called clusters and blocks; if the units corresponding to a given item are scattered in one, that one is fragmented. They must be mounted before use. For 10 points, name these protocols for organizing data on storage devices like hard drives, examples of which include Reiser, ext2 and 3, and FAT.
One feature of some of these is extents. They can use index, linked, or contiguous allocation.
{file systems} (prompt on {FSs})