Disconnected Operation in the Coda File System

Slides:



Advertisements
Similar presentations
Computer Science Lecture 20, page 1 CS677: Distributed OS Today: Coda, xFS Case Study: Coda File System Brief overview of other recent file systems –xFS.
Advertisements

File System for Mobile Computing Quick overview of AFS identify the issues for file system design in wireless and mobile environments Design Options for.
CODA/AFS (Constant Data Availability)
Overview of Mobile Computing (3): File System. File System for Mobile Computing Issues for file system design in wireless and mobile environments Design.
G Robert Grimm New York University Disconnected Operation in the Coda File System.
Disconnected Operation in the Coda File System James J. Kistler and M. Satyanarayanan Carnegie Mellon University Presented by Deepak Mehtani.
Disconnected Operation in the Coda File System James J. Kistler and M. Satyanarayanan Carnegie Mellon University Presented by Cong.
Coda file system: Disconnected operation By Wallis Chau May 7, 2003.
Computer Science Lecture 21, page 1 CS677: Distributed OS Today: Coda, xFS Case Study: Coda File System Brief overview of other recent file systems –xFS.
HA LVS Coda - Devjani Sinha. High Availability-HA n critical commercial applications move on the Internet n An elegant highly available system may have.
1 CS 194: Distributed Systems Distributed File Systems Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and.
Toolkits for Building Mobile Systems 3/28/2002 Michael Ferguson
Disconnected Operation In The Coda File System James J Kistler & M Satyanarayanan Carnegie Mellon University Presented By Prashanth L Anmol N M Yulong.
G Robert Grimm New York University Scale and Performance in Distributed File Systems: AFS and SpriteFS.
1 Preliminaries  Rest of the semester, focus on mobile computing  Unfortunately, running out of time, we may need a make up class  Feedback – less networking/more.
Concurrency Control & Caching Consistency Issues and Survey Dingshan He November 18, 2002.
Jeff Chheng Jun Du.  Distributed file system  Designed for scalability, security, and high availability  Descendant of version 2 of Andrew File System.
Distributed File System: Data Storage for Networks Large and Small Pei Cao Cisco Systems, Inc.
Mobility Presented by: Mohamed Elhawary. Mobility Distributed file systems increase availability Remote failures may cause serious troubles Server replication.
Adaptation for Mobile Data Access (DM1 & PL1) Yerang Hur Mar. 24, 1998.
Update Propagation with Variable Connectivity Prasun Dewan Department of Computer Science University of North Carolina
Distributed Systems Principles and Paradigms Chapter 10 Distributed File Systems 01 Introduction 02 Communication 03 Processes 04 Naming 05 Synchronization.
Mobility in Distributed Computing With Special Emphasis on Data Mobility.
Replication for Mobile Computing Prasun Dewan Department of Computer Science University of North Carolina
Distributed File Systems Case Studies: Sprite Coda.
Replication March 16, Replication What is Replication?  A technique for increasing availability, fault tolerance and sometimes, performance 
1 Mobile File Systems: Disconnected and Weakly Connected File Systems 3/29/2004 Richard Yang.
DISCONNECTED OPERATION IN THE CODA FILE SYSTEM J. J. Kistler M. Sataynarayanan Carnegie-Mellon University.
CS 525M – Mobile and Ubiquitous Computing Seminar Bradley Momberger.
CODA: A HIGHLY AVAILABLE FILE SYSTEM FOR A DISTRIBUTED WORKSTATION ENVIRONMENT M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel,
Example: Rumor Performance Evaluation Andy Wang CIS 5930 Computer Systems Performance Analysis.
Mobile File System Byung Chul Tak. AFS  Andrew File System Distributed computing environment developed at CMU provides transparent access to remote shared.
Mobile Data Access1 Replication, Caching, Prefetching and Hoarding for Mobile Computing.
Presented By: Samreen Tahir Coda is a network file system and a descendent of the Andrew File System 2. It was designed to be: Highly Highly secure Available.
CS425 / CSE424 / ECE428 — Distributed Systems — Fall 2011 Some material derived from slides by Prashant Shenoy (Umass) & courses.washington.edu/css434/students/Coda.ppt.
Distributed File Systems
Information/File Access and Sharing Coda: A Case Study J. Kistler, M. Satyanarayanan. Disconnected operation in the Coda File System. ACM Transaction on.
Caching Consistency and Concurrency Control Contact: Dingshan He
Fault Tolerance and Replication
Lecture 8 – Distributed File Systems Distributed Systems.
Write Conflicts in Optimistic Replication Problem: replicas may accept conflicting writes. How to detect/resolve the conflicts? client B client A replica.
An Architecture for Mobile Databases By Vishal Desai.
Overview of Mobile File Systems Presented by Steve Todd For WSU CS 898T Mobile and Wireless Networks Class 5/3/04.
Outline for Today’s Lecture Administrative: Objective: –Disconnection in file systems –Energy management.
EE324 INTRO TO DISTRIBUTED SYSTEMS L-20 More DFS.
Highly Available Services and Transactions with Replicated Data Jason Lenthe.
Computer Science Lecture 19, page 1 CS677: Distributed OS Last class: Distributed File Systems Issues in distributed file systems Sun’s Network File System.
THE EVOLUTION OF CODA M. Satyanarayanan Carnegie-Mellon University.
Feb 22, 2001CSCI {4,6}900: Ubiquitous Computing1 Announcements Send today with people in your project group. People seem to be dropping off and I.
Truly Distributed File Systems Paul Timmins CS 535.
Mobility Victoria Krafft CS /25/05. General Idea People and their machines move around Machines want to share data Networks and machines fail Network.
Mobile File Systems.
Coda / AFS Thomas Brown Albert Ng.
Nomadic File Systems Uri Moszkowicz 05/02/02.
Synchronizing Processes
Example Replicated File Systems
Presented By Abhishek Khaitan Adhip Joshi
Distributed P2P File System
Today: Coda, xFS Case Study: Coda File System
Distributed File Systems
Distributed File Systems
Overview Assignment 12: solution Distributed file systems 1/13/2019.
Distributed File Systems
08 - Distributed File Systems 2 CODA, LBFS, Dropbox
University of Southern California Information Sciences Institute
Distributed File Systems
Distributed File Systems
System-Level Support CIS 640.
Presentation transcript:

Disconnected Operation in the Coda File System James J. Kistler M. Satyanarayanan

History Descendent of AFS, also a CMU project In development since 1987 Support is included in the official Linux kernel

Motivation Distributed file systems are not immune to failures Laptop computers are popular

Key Points Caching file data can be used to provide high availability High availability allows disconnected operation The Coda file system provides these features

Design Goals Scalability Voluntary vs. Involuntary Disconnections First vs. Second Class Replication Optimistic vs. Pessimistic Replica Control

Scalability Experience with AFS Whole-file caching Functionality at clients, rather than servers

Voluntary vs. Involuntary Disconnections Laptops Types of disconnection are not functionally different

First vs. Second Class Replication Why have server replicas at all? Server replicas (first class) High quality Additional cost Client replicas (second class) Generally inferior Very little cost

Optimistic vs. Pessimistic Replica Control Pessimistic control Avoids conflicting operations Clients acquire shared or exclusive control of objects Optimistic control Reads and writes everywhere! Detects and resolves conflicts after they occur

Venus States

Venus States: Hoarding Client is connected to server Caches information in anticipation of disconnection Factors complicate implementation Prioritized cache management Hoard walking

Hoarding: Prioritized Cache Management Hoard database Explicit prioritization, generated by user Contains pathnames and priorities corresponding to file system objects Recent reference history Implicit prioritization Updated continuously as objects are referenced

Hoarding: Hoard Walking Equilibrium Two phases: Reevaluate HDB entries to reflect activity by other clients Reevaluate priorities and restore equilibrium

Performance Duration of reintegration Cache size Likelihood of conflicts

Cache Size

Likelihood of Conflicts Data based on AFS server usage Tracked who made modifications Measured time between modifications Promising results: 99% of all modifications were made by the previous writer

Likelihood of Conflicts

Recap Coda provides disconnected operation by aggressively caching file data

My Evaluation Resource exhaustion Likelihood of conflicts

More Info http://www.coda.cs.cmu.edu/