Solutions for the Fourth Problem Set COSC 6360 Fall 2014.

Slides:



Advertisements
Similar presentations
Key distribution and certification In the case of public key encryption model the authenticity of the public key of each partner in the communication must.
Advertisements

Kerberos 1 Public domain image of Heracles and Cerberus. From an Attic bilingual amphora, 530–520 BC. From Italy (?).
The Zebra Striped Network Filesystem. Approach Increase throughput, reliability by striping file data across multiple servers Data from each client is.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
Ceph: A Scalable, High-Performance Distributed File System
CS-550: Distributed File Systems [SiS]1 Resource Management in Distributed Systems: Distributed File Systems.
G Robert Grimm New York University Disconnected Operation in the Coda File System.
Distributed File System: Design Comparisons II Pei Cao Cisco Systems, Inc.
Jeff Chheng Jun Du.  Distributed file system  Designed for scalability, security, and high availability  Descendant of version 2 of Andrew File System.
NFS. The Sun Network File System (NFS) An implementation and a specification of a software system for accessing remote files across LANs. The implementation.
University of Pennsylvania 11/21/00CSE 3801 Distributed File Systems CSE 380 Lecture Note 14 Insup Lee.
Distributed File System: Data Storage for Networks Large and Small Pei Cao Cisco Systems, Inc.
DISTRIBUTED COMPUTING
DESIGN AND IMPLEMENTATION OF THE SUN NETWORK FILESYSTEM R. Sandberg, D. Goldberg S. Kleinman, D. Walsh, R. Lyon Sun Microsystems.
Distributed File Systems Sarah Diesburg Operating Systems CS 3430.
Lecture 23 The Andrew File System. NFS Architecture client File Server Local FS RPC.
Sun NFS Distributed File System Presentation by Jeff Graham and David Larsen.
A Low-Bandwidth Network File System A. Muthitacharoen, MIT B. Chen, MIT D. Mazieres, NYU.
Network File Systems II Frangipani: A Scalable Distributed File System A Low-bandwidth Network File System.
A LOW-BANDWIDTH NETWORK FILE SYSTEM A. Muthitacharoen, MIT B. Chen, MIT D. Mazieres, New York U.
Distributed File Systems Concepts & Overview. Goals and Criteria Goal: present to a user a coherent, efficient, and manageable system for long-term data.
Review Session for Fourth Quiz Jehan-François Pâris Summer 2011.
Distributed File Systems 1 CS502 Spring 2006 Distributed Files Systems CS-502 Operating Systems Spring 2006.
Solutions to the first midterm COSC 4330/6310 Summer 2012.
Distributed File Systems
SOEN 6011 Software Engineering Processes Section SS Fall 2007 Dr Greg Butler
Distributed File Systems Case Studies: Sprite Coda.
Distributed File Systems Overview  A file system is an abstract data type – an abstraction of a storage device.  A distributed file system is available.
CS 5204 (FALL 2005)1 Leases: An Efficient Fault Tolerant Mechanism for Distributed File Cache Consistency Gray and Cheriton By Farid Merchant Date: 9/21/05.
CEPH: A SCALABLE, HIGH-PERFORMANCE DISTRIBUTED FILE SYSTEM S. A. Weil, S. A. Brandt, E. L. Miller D. D. E. Long, C. Maltzahn U. C. Santa Cruz OSDI 2006.
Introduction to DFS. Distributed File Systems A file system whose clients, servers and storage devices are dispersed among the machines of a distributed.
Review Questions on Chapter IV—IPC COSC 4330/6310 Summer 2013.
SPECULATIVE EXECUTION IN A DISTRIBUTED FILE SYSTEM E. B. Nightingale P. M. Chen J. Flint University of Michigan.
CODA: A HIGHLY AVAILABLE FILE SYSTEM FOR A DISTRIBUTED WORKSTATION ENVIRONMENT M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel,
Ceph: A Scalable, High-Performance Distributed File System
A Low-bandwidth Network File System Athicha Muthitacharoen et al. Presented by Matt Miller September 12, 2002.
Computer Science Lecture 19, page 1 CS677: Distributed OS Last Class: Fault tolerance Reliable communication –One-one communication –One-many communication.
Distributed File Systems
Caching Consistency and Concurrency Control Contact: Dingshan He
ENERGY-EFFICIENCY AND STORAGE FLEXIBILITY IN THE BLUE FILE SYSTEM E. B. Nightingale and J. Flinn University of Michigan.
GLOBAL EDGE SOFTWERE LTD1 R EMOTE F ILE S HARING - Ardhanareesh Aradhyamath.
A Low-bandwidth Network File System Presentation by Joseph Thompson.
Solution to the Third COSC 6360 Quiz for Fall 2013 Jehan-François Pâris
Yet another Pop Quiz COSC 6360 Fall The rules On any sheet of paper, please write  You full name, first name first  Today's date  Your answers.
Distributed File Systems 11.2Process SaiRaj Bharath Yalamanchili.
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
Distributed File Systems Questions answered in this lecture: Why are distributed file systems useful? What is difficult about distributed file systems?
THE EVOLUTION OF CODA M. Satyanarayanan Carnegie-Mellon University.
Chapter Five Distributed file systems. 2 Contents Distributed file system design Distributed file system implementation Trends in distributed file systems.
Computer Science Lecture 19, page 1 CS677: Distributed OS Last Class: Fault tolerance Reliable communication –One-one communication –One-many communication.
DISTRIBUTED FILE SYSTEM- ENHANCEMENT AND FURTHER DEVELOPMENT BY:- PALLAWI(10BIT0033)
Solutions for Fourth Quiz COSC 6360 Fall First question What do we mean when we say that NFS client requests are: (2×10 pts)  self-contained? 
Distributed File Systems
Solutions for Fourth Quiz
Solutions for Second Quiz
Solution to the Fourth COSC 6360 Quiz for Fall 2013
Today: Coda, xFS Case Study: Coda File System
CSE 451: Operating Systems Winter Module 22 Distributed File Systems
Distributed File Systems
Distributed File Systems
Overview Assignment 12: solution Distributed file systems 1/13/2019.
Cary G. Gray David R. Cheriton Stanford University
CSE 451: Operating Systems Spring Module 21 Distributed File Systems
Distributed File Systems
CSE 451: Operating Systems Winter Module 22 Distributed File Systems
Solutions for the Third Problem Set
Solutions for Third Quiz
Federated, Available, and Reliable Storage for an Incompletely Trusted Environment Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie.
Distributed File Systems
Distributed File Systems
Presentation transcript:

Solutions for the Fourth Problem Set COSC 6360 Fall 2014

First question Which of the following properties apply to NFS?  Works with diskless workstations.  Requires all client requests to be idempotent.  Disables client caching when conflicting updates are detected.  Requires servers to trust their clients’ kernels

Answers  Works with diskless workstations. TRUE  Requires all client requests to be idempotent. TRUE (required by statelessness)  Disables client caching when conflicting updates are detected. FALSE (would violate statelessness)  Requires servers to trust their clients’ kernels TRUE

Second question Consider a distributed file system implementing close-to-open consistency. Assuming that  Alice opens the file at 9:30 AM, modifies it and closes it at 10:30 AM,  Bob opens the file at 10:00 AM, modifies it and closes it at 10:40 AM,  Carol opens the file at 10:45 AM, modifies it and closes it at 11:30 AM, Which of these three users would see his or her changes actually incorporated in the final version of the file?

Answer 9:3010:30 Alice 10:0010:40 Bob 10:45 11:30 Carol X

Third question Comparing callbacks and leases, which one is better suited to which environment? (5 pts per correct line)  The users’ workstations always remain connected to their servers.  The users’ workstations will sometimes operate in disconnected mode.

Answer Comparing callbacks and leases, which one is better suited to which environment? (5 pts per correct line)  The users’ workstations always remain connected to their servers. Leases are better  The users’ workstations will sometimes operate in disconnected mode. Callbacks are better

Fourth question How does LBFS detect identical chunks?

Answer How does LBFS detect identical chunks?  It uses the collision-resistant property of the SHA-1 hash function.

Sixth question How does Wolverine create bursty device access patterns?

Answer How does Wolverine create bursty device access patterns?  By flushing its entire write queues at once.

Seventh question How do Ceph clients find out where their data are stored? What is the main advantage of the approach?

Answer How do Ceph clients find out where their data are stored?  Using a pseudo-random function (CRUSH) What is the main advantage of the approach?  Metadata servers do not have to keep track of object addresses

Eighth question Assuming that we want to protect a FARSITE distributed file system against two simultaneous machine failures,  What would be the minimum size for all your directory groups? Answer: _____ machines  On how many machines should the contents of your files be replicated? Answer: _____ machines

Answers Assuming that we want to protect a FARSITE distributed file system against two simultaneous machine failures,  What would be the minimum size for all your directory groups? Answer: 2×3 + 1 = 7 machines  On how many machines should the contents of your files be replicated? Answer: = 3 machines