File system initialization:
What is the maximum number of disk I/O operations required to add a block to the end of the file for each of: contiguous allocation, linked-list allocation with index and i-nodes. Assume the base file descriptor is currently cached in memory, but nothing else is.
Consider a file system that supports aliases (links). Suppose we have:
/home/mark/file.txt
/user/local/temp.txt
Where "temp.txt" and "file.txt" are intended to refer to the same set
of data blocks on the disk (ie - the same file). If "temp.txt" was a
hard-link, what would happen if "file.txt" was deleted? If
"temp.txt" was a soft-link, what would happen if "file.txt" was
deleted? Explain.
Why do large file-system blocks (typically) result in better file system access times. Why do large blocks result in less efficient use of disk space?
Name and describe 3 types of possible transparency in distributed system.
Name 2 techniques to aid scalability of distributed systems. Provide an example for each.
Give an example of a Client-Server system with a "fat" client. What would be the effect of making the client "thin" for this system?
What is journaling and describe its role in modern file systems?
Describe how some of the issues of a large number of free blocks possible on today's modern disks can be handled in modern file systems.
How is the WAFL inode different than a traditional inode?
How can the Web support both client-side and server-side processing?
Describe a strong cache-consistency mechanism for the Web. Describe a weak cache-consistency mechanism.
Return
to the CS4513 Home Page