Log-Strucutred File Systems Flashcards
What are 3 motivations for log-structured file systems?
- Growing memory size (performance determined by writes)
- File systems perform many random operations (especially random writes with in-place update)
- File systems were not RAID- aware (RAID setups incur many writes)
In a LFS, we turn writes _______
sequential
Writing single blocks _________ does not guarantee _______ writes
sequentially, efficient
An example of a inefficient sequential write is writing A1, then having to wait for ____ _______ to write A2
disk rotation
To increase write efficiency, we keep track of all updates in a ________ ______ AKA ______
memory buffer, segment
When the memory buffer has enough _______ write them to disk all at once
updates
What is the equation used to calculate how big the memory buffer should be?
D = (F/1-F) * R_peak * T_position where F = % of R_peak R_peak = disk transfer rate T_position = positioning time
Inodes are ______ throughout the disk in a LFS
scattered
We can find scattered inodes by using an ______ _____
inode map
An inode map maps inode numbers to the address of the most ______ version inode
recent
To maintain the _______ _______ guarantee in a LFS, we place the inode map next to where it is updating all the other new information
sequential writes
To find the inode map spread across the disk, we maintain a fixed location on _____ to begin a file lookup
disk
A ________ _______ contains pointers to the latest pieces of the inode map
checkpoint region
The checkpoint region is only updated _____________
periodically
What are the four steps in reading a file from disk in a LFS?
- Read checkpoint region
- Read entire inode map and cache to memory
- Read the most recent inode
- Read a block from by using in/direct or doubly indirect pointers
