Chapter 6.5 Distributed File Systems Summary Junfei Wen Fall 2013.

Slides:



Advertisements
Similar presentations
DISTRIBUTED FILE SYSTEM SUMMARY RANJANI SANKARAN.
Advertisements

Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.
PHANI VAMSI KRISHNA.MADDALI. BASIC CONCEPTS.. FILE SYSTEMS: It is a method for storing and organizing computer files and the data they contain to make.
Topic 6.3: Transactions and Concurrency Control Hari Uday.
Replication Management. Motivations for Replication Performance enhancement Increased availability Fault tolerance.
Distributed Storage March 12, Distributed Storage What is Distributed Storage?  Simple answer: Storage that can be shared throughout a network.
Yanjun Zhao.  A network file system where a single file system can be distributed across several physical computers  allows administrators to group.
Distributed Systems Fall 2010 Replication Fall 20105DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Distributed Systems 2006 Styles of Client/Server Computing.
CS 582 / CMPE 481 Distributed Systems
Coda file system: Disconnected operation By Wallis Chau May 7, 2003.
Other File Systems: LFS and NFS. 2 Log-Structured File Systems The trend: CPUs are faster, RAM & caches are bigger –So, a lot of reads do not require.
Session - 14 CONCURRENCY CONTROL CONCURRENCY TECHNIQUES Matakuliah: M0184 / Pengolahan Data Distribusi Tahun: 2005 Versi:
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Concurrency Control & Caching Consistency Issues and Survey Dingshan He November 18, 2002.
CS 425 / ECE 428 Distributed Systems Fall 2014 Indranil Gupta (Indy) Lecture 18: Replication Control All slides © IG.
University of Pennsylvania 11/21/00CSE 3801 Distributed File Systems CSE 380 Lecture Note 14 Insup Lee.
-Bhavya Kilari Dr. Yanqing Zhang, CSc PREVIEW P ART I : I NTRODUCTION o Transaction Processing System [ R. Chow & T. Johnson, 1997 ] o Serializability.
Team CMD Distributed Systems Team Report 2 1/17/07 C:\>members Corey Andalora Mike Adams Darren Stanley.
6.4 Data and File Replication Gang Shen. Why replicate  Performance  Reliability  Resource sharing  Network resource saving.
TRANSACTIONS AND CONCURRENCY CONTROL Sadhna Kumari.
Distributed File Systems Concepts & Overview. Goals and Criteria Goal: present to a user a coherent, efficient, and manageable system for long-term data.
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Distributed File Systems Steve Ko Computer Sciences and Engineering University at Buffalo.
AN OPTIMISTIC CONCURRENCY CONTROL ALGORITHM FOR MOBILE AD-HOC NETWORK DATABASES Brendan Walker.
6.4 Data And File Replication Presenter : Jing He Instructor: Dr. Yanqing Zhang.
Distributed Systems Principles and Paradigms Chapter 10 Distributed File Systems 01 Introduction 02 Communication 03 Processes 04 Naming 05 Synchronization.
Distributed File Systems
Transaction Communications Yi Sun. Outline Transaction ACID Property Distributed transaction Two phase commit protocol Nested transaction.
Distributed File Systems Overview  A file system is an abstract data type – an abstraction of a storage device.  A distributed file system is available.
Chapter 20 Distributed File Systems Copyright © 2008.
What is a Distributed File System?? Allows transparent access to remote files over a network. Examples: Network File System (NFS) by Sun Microsystems.
Distributed File System By Manshu Zhang. Outline Basic Concepts Current project Hadoop Distributed File System Future work Reference.
Consistent and Efficient Database Replication based on Group Communication Bettina Kemme School of Computer Science McGill University, Montreal.
Practical Byzantine Fault Tolerance
Introduction to DFS. Distributed File Systems A file system whose clients, servers and storage devices are dispersed among the machines of a distributed.
Chapter 6 Distributed File Systems Summary Bernard Chen 2007 CSc 8230.
Outline Introduction (what’s it all about) Data-centric consistency Client-centric consistency Replica management Consistency protocols.
Ch 10 Shared memory via message passing Problems –Explicit user action needed –Address spaces are distinct –Small Granularity of Transfer Distributed Shared.
IM NTU Distributed Information Systems 2004 Replication Management -- 1 Replication Management Yih-Kuen Tsay Dept. of Information Management National Taiwan.
By Shruti poundarik.  Data Objects and Files are replicated to increase system performance and availability.  Increased system performance achieved.
Copyright © George Coulouris, Jean Dollimore, Tim Kindberg This material is made available for private study and for direct.
Distributed File Systems
Transactions and Concurrency Control. Concurrent Accesses to an Object Multiple threads Atomic operations Thread communication Fairness.
Fault Tolerance and Replication
GLOBAL EDGE SOFTWERE LTD1 R EMOTE F ILE S HARING - Ardhanareesh Aradhyamath.
Chapter 4 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University Building Dependable Distributed Systems.
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Replication Steve Ko Computer Sciences and Engineering University at Buffalo.
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
Highly Available Services and Transactions with Replicated Data Jason Lenthe.
CSE 486/586, Spring 2014 CSE 486/586 Distributed Systems Transactions on Replicated Data Steve Ko Computer Sciences and Engineering University at Buffalo.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Lecture 24: GFS.
Dsitributed File Systems
Distributed File System. Outline Basic Concepts Current project Hadoop Distributed File System Future work Reference.
Chapter Five Distributed file systems. 2 Contents Distributed file system design Distributed file system implementation Trends in distributed file systems.
DFS Design and Implementation Yang Wang. Review Characteristics of a DFS: a. Dispersed clients b. Dispersed files c. Multiplicity of Users d. Multiplicity.
Advanced Operating Systems Chapter 6.1 – Characteristics of a DFS Jongchan Shin.
6.4 Data and File Replication
Distributed File Systems
DISTRIBUTED COMPUTING
Outline Midterm results summary Distributed file systems – continued
Consistency and Replication
EEC 688/788 Secure and Dependable Computing
Outline Announcements Lab2 Distributed File Systems 1/17/2019 COP5611.
Replica Placement Model: We consider objects (and don’t worry whether they contain just data or code, or both) Distinguish different processes: A process.
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Slides for Chapter 18: Replication
Distributed Systems (15-440)
Ch 6. Summary Gang Shen.
Distributed Systems and Concurrency: Distributed Systems
Presentation transcript:

Chapter 6.5 Distributed File Systems Summary Junfei Wen Fall 2013

Outline 6.1 Characteristics of DFS 6.2 DFS Design and Implementation 6.3 Transaction and Concurrency Control 6.4 Data and File Replication Current Work Future Work

6.1Characteristics of DFS Dispersion Dispersed Files Location Transparent Location Independent Dispersed Clients login transparency access transparency Multiplicity Multiple Files Replication Transparency Multiple Clients Concurrency Transparency Others (general) Fault Tolerance – crash of server or client, loss of message Scalability – Incremental file system growth Efficient

6.2DFS Design and Implementation Hierarchy files structure File mounting protocol – Explicit mounting, manual – Boot mounting, boot up time mounting – Auto mounting, mounting at use Distribute state information between server and clients. Stateless or stateful server

File access – Space multiplexing, multiple copy of file Remote access Cache access Download/upload access – Time multiplexing, concurrent control. Same file different time Simple RW Transaction session File sharing semantics Unix, update propagated immediately Session, delayed update Transaction, delayed update

COMPONENTS IN A FILE SYSTEM

6.3Transaction and Concurrency Control Distribdute Transaction Processing System: – Transaction Manager: correct execution of local and remote transactions. – Scheduler: schedules operations to avoid conflicts using locks, timestamps and validation managers. – Object Manager: coherency of replicas/caches; interface to the file system.

Serializability: A schedule is Serializable if the result of execution is equivalent to that of a serial schedule. Concurrency Control Protocol required to maintain ACID Semantics for Concurrent transactions. – Two phase locking – Timestamp ordering – Optimistic

6.4Data and File Replication Architecture Client chooses one / more FSA to access data object. FSA acts as front end to replica managers RMs to provide replication transparency. FSA contacts one or more RMs for actual updating and reading of data objects.

One-copy Serializability: – The execution of transaction on replicated objects is equivalent to the execution of the same transactions on non-replicated objects – Read Operations : Read-one-primary, Read-one,Read-quorum – Write Operations:Write-one-primary,Write- all,Write-all-available,Write-quorum,Write-gossip

Quorum Voting : Uses Read Quorum, Write Quorum – Write-write conflict: 2 * Write quorum > all object copies – Read-write conflict: Write quorum + read quorum > all object copies. Gossip Update Propagation: – Read: if TSfsa<=TSrm, RM has recent data, return it, otherwise wait for gossip, or try other RM – Update :if Tsfsa>TSrm, update. Update TSrm send gossip. Otherwise, process based on application, perform update or reject – Gossip : update RM if gossip carries new updates.

Current work A Distributed Cache for Hadoop Distributed File System in Real-Time Cloud Service A Distributed Cache for Hadoop Distributed File System in Real-Time Cloud Service Intensive Workload Consolidation for the Hadoop Distributed File Systems Intensive Workload Consolidation for the Hadoop Distributed File Systems An integrated high-performance distributed file system implementation on existing local network An integrated high-performance distributed file system implementation on existing local network A Cost-Effective File Lookup Service in a Distributed Metadata File System A Cost-Effective File Lookup Service in a Distributed Metadata File System The Mobile Agent-based Distributed Network File system

Future work Innovations in the area of security for Distributed/Cloud Computing Improve efficiency of Parallel/Distributed system Concurrency control protocol Improve Efficiency and Effectiveness of file replication scheme Integrate File Replication and Consistency Maintenance

Reference [1]Distributed Operating Systems and Algorithm Analysis, Andy Chow & Theodore Johnson,1997 [2] “Optimizing File Replication over Limited-Bandwidth Networks using Remote Differential Compression” IEEE Infocom Conference, [3] Transaction Management and Concurrency control by Connolly & Begg. Chapter 19. Third edition [4] "Distributed File System Replication: Frequently Asked Questions"; rver/en/library/f9b98a0f-c1ae-4a9f c679596e6b1033.mspx?mfr=true [5] [6] the-future-of-file-systems -Future of File Systemshttp:// the-future-of-file-systems

Thank you !