1. CS4513 Distributed Computer Systems Review

2. What is a file descriptor? –What information must it contain? –What information might it contain?

3. Linked-List with Index How many files are there? How large are they? How many free blocks are there? Physical Block 0 1 null 2 3 7 4 5 3 6 2 7

4. I-Node How many data blocks are there? If you added 3 more data blocks to the file, what would happen? Disk blocks i-node null 62 77

5. Review Directories: –In what way is a directory different than a file? –In what way is a directory similar to a file? Aliases: –Describe a hard-link –Describe a soft-link Free space management: –What are two common methods of keeping track of free blocks?

6. Flo00 What is an extent? What is a B+tree? What are they used for?

7. Flo00 What is journaling? How is it used in modern file systems? How do large disks cause problems for some file systems? How are those problems addressed in modern file systems?

8. HLM02 How is a WAFL inode different than a traditional inode? How does WAFL avoid copying every block during a snapshot? What is a consistency point?

9. HLM02 (Label the axes)

10. Distributed Systems Intro What is a distributed system? What are some forms of transparency a distributed system might achieve? Why are centralized solutions bad for distributed systems? –Give an example