CS432S15HW1

1
Alexandria University Faculty of Engineering Electrical Engineering Spring 2015 Homework 1 CS432: Distributed Systems Assigned: April 11, 2015 Due: April 21, 2015 Homework 1: Distributed File Systems 1. Tanenbaum’2006 (Ch11Q6): Give a simple extension to the NFS lookup operation that would allow iterative name lookup in combination with a server exporting directories that it mounted from another server. 2. Tanenbaum’2006 (Ch11Q3): Despite that GFS scales well, it could be argued that the master is still a potential bottleneck. What would be a reasonable alternative to replace it? 3. True/False. Justify your answer. (a) An NFS file system appears at the same file path on all clients. (b) An AFS file system appears at the same file path on all clients. 4. List three of the requirements of a distributed file systems. Choose one of the three distributed file systems studied in class and show how these three requirements are satisfied in it. 5. List three of the design assumptions of the GFS. 6. Tanenbaum’2006 (Ch11Q8): Using an automounter that installs symbolic links as described in the text makes it harder to hide the fact that mounting is transparent. Why? 7. Coulouris’11 (Ch12Q4): Why should UFIDs be unique across all possible file systems? How is uniqueness for UFIDs ensured? 8. Coulouris’11 (Ch12Q17): Which features of the AFS design make it more scalable than NFS? What are the limits on its scalability, assuming that servers can be added as required? Which recent developments offer greater scalability? 9. Coulouris’11 (Ch21Q2): The key requirements for the Google infrastructure are scalability, relia- bility, performance and openness. Provide three example of where these requirements might be in conflict and discuss how Google deals with these potential conflicts. 1 of 1

description

CS432S15HW1

Transcript of CS432S15HW1

  • Alexandria UniversityFaculty of EngineeringElectrical EngineeringSpring 2015

    Homework 1CS432: Distributed Systems

    Assigned: April 11, 2015Due: April 21, 2015

    Homework 1: Distributed File Systems1. Tanenbaum2006 (Ch11Q6): Give a simple extension to the NFS lookup operation that would

    allow iterative name lookup in combination with a server exporting directories that it mountedfrom another server.

    2. Tanenbaum2006 (Ch11Q3): Despite that GFS scales well, it could be argued that the master isstill a potential bottleneck. What would be a reasonable alternative to replace it?

    3. True/False. Justify your answer.

    (a) An NFS file system appears at the same file path on all clients.

    (b) An AFS file system appears at the same file path on all clients.

    4. List three of the requirements of a distributed file systems. Choose one of the three distributedfile systems studied in class and show how these three requirements are satisfied in it.

    5. List three of the design assumptions of the GFS.

    6. Tanenbaum2006 (Ch11Q8): Using an automounter that installs symbolic links as described inthe text makes it harder to hide the fact that mounting is transparent. Why?

    7. Coulouris11 (Ch12Q4): Why should UFIDs be unique across all possible file systems? How isuniqueness for UFIDs ensured?

    8. Coulouris11 (Ch12Q17): Which features of the AFS design make it more scalable than NFS?What are the limits on its scalability, assuming that servers can be added as required? Whichrecent developments offer greater scalability?

    9. Coulouris11 (Ch21Q2): The key requirements for the Google infrastructure are scalability, relia-bility, performance and openness. Provide three example of where these requirements might bein conflict and discuss how Google deals with these potential conflicts.

    1 of 1