Dennis Kafura – CS5204 – Operating Systems

Slides:



Advertisements
Similar presentations
CS 5204 – Operating Systems1 Paxos Student Presentation by Jeremy Trimble.
Advertisements

Linearizability Linearizability is a correctness criterion for concurrent object (Herlihy & Wing ACM TOPLAS 1990). It provides the illusion that each operation.
Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
The SMART Way to Migrate Replicated Stateful Services Jacob R. Lorch, Atul Adya, Bill Bolosky, Ronnie Chaiken, John Douceur, Jon Howell Microsoft Research.
Chubby Lock server for distributed applications 1Dennis Kafura – CS5204 – Operating Systems.
Replica Control for Peer-to- Peer Storage Systems.
Dynamo Highly Available Key-Value Store 1Dennis Kafura – CS5204 – Operating Systems.
Database Replication techniques: a Three Parameter Classification Authors : Database Replication techniques: a Three Parameter Classification Authors :
CS 582 / CMPE 481 Distributed Systems Fault Tolerance.
CS 582 / CMPE 481 Distributed Systems
CS 582 / CMPE 481 Distributed Systems Replication.
1 ICS 214B: Transaction Processing and Distributed Data Management Replication Techniques.
Manajemen Basis Data Pertemuan 10 Matakuliah: M0264/Manajemen Basis Data Tahun: 2008.
Oct 1999SRDS 991 On Diffusing Updates in a Byzantine Environment Dahlia Malkhi Yishay Mansour Michael K. Reiter.
SynchronizationCS-4513, D-Term Synchronization in Distributed Systems CS-4513 D-Term 2007 (Slides include materials from Operating System Concepts,
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Synchronization in Distributed Systems CS-4513 D-term Synchronization in Distributed Systems CS-4513 Distributed Computing Systems (Slides include.
More on Replication and Consistency CS-4513 D-term More on Replication and Consistency CS-4513 Distributed Computing Systems (Slides include materials.
6.4 Data and File Replication Gang Shen. Why replicate  Performance  Reliability  Resource sharing  Network resource saving.
Distributed File Systems Sarah Diesburg Operating Systems CS 3430.
Orbe: Scalable Causal Consistency Using Dependency Matrices & Physical Clocks Jiaqing Du, EPFL Sameh Elnikety, Microsoft Research Amitabha Roy, EPFL Willy.
© 2011 Cisco All rights reserved.Cisco Confidential 1 APP server Client library Memory (Managed Cache) Memory (Managed Cache) Queue to disk Disk NIC Replication.
Replication and Consistency. Reference The Dangers of Replication and a Solution, Jim Gray, Pat Helland, Patrick O'Neil, and Dennis Shasha. In Proceedings.
Replication March 16, Replication What is Replication?  A technique for increasing availability, fault tolerance and sometimes, performance 
Replica Consistency in a Data Grid1 IX International Workshop on Advanced Computing and Analysis Techniques in Physics Research December 1-5, 2003 High.
Feb 1, 2001CSCI {4,6}900: Ubiquitous Computing1 Eager Replication and mobile nodes Read on disconnected clients may give stale data Eager replication prohibits.
Chord Advanced issues. Analysis Theorem. Search takes O (log N) time (Note that in general, 2 m may be much larger than N) Proof. After log N forwarding.
Fault Tolerant Services
CSE 486/586 Distributed Systems Consistency --- 3
CS 425/ECE 428 Distributed Systems Nitin Vaidya. T.A.s – Persia Aziz – Frederick Douglas – Su Du – Yixiao Lin.
Fail-Stop Processors UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department CS 739 Distributed Systems Andrea C. Arpaci-Dusseau One paper: Byzantine.
Reliable multicast Tolerates process crashes. The additional requirements are: Only correct processes will receive multicasts from all correct processes.
The Case for a Session State Storage Layer
CSE 486/586 Distributed Systems Case Study: Amazon Dynamo
Distributed File Systems
Distributed Systems – Paxos
Google File System.
Lecturer : Dr. Pavle Mogin
6.4 Data and File Replication
View Change Protocols and Reconfiguration
CSE 486/586 Distributed Systems Consistency --- 3
Implementing Consistency -- Paxos
Consistent Data Access From Data Centers
Introduction There are many situations in which we might use replicated data Let’s look at another, different one And design a system to work well in that.
EECS 498 Introduction to Distributed Systems Fall 2017
Outline Announcements Fault Tolerance.
Chord Advanced issues.
Linearizability Linearizability is a correctness criterion for concurrent object (Herlihy & Wing ACM TOPLAS 1990). It provides the illusion that each operation.
EECS 498 Introduction to Distributed Systems Fall 2017
7.1. CONSISTENCY AND REPLICATION INTRODUCTION
CS 347: Parallel and Distributed Data Management Notes 11: Network Partitions Hector Garcia-Molina CS347 Notes11.
Replication Improves reliability Improves availability
Chord Advanced issues.
Consistency and Replication
Assignment 8 - Solution Problem 1 - We replicate database DB1.
Concurrency Unit 4.2 Dr Gordon Russell, Napier University
Chord Advanced issues.
Cary G. Gray David R. Cheriton Stanford University
Distributed Transactions
Replication and Availability in Distributed Systems
EECS 498 Introduction to Distributed Systems Fall 2017
CMSC Cluster Computing Basics
View Change Protocols and Reconfiguration
Economics “Econ, Econ” Econ.
The SMART Way to Migrate Replicated Stateful Services
Concurrency Unit 4.2 Dr Gordon Russell, Napier University
Implementing Consistency -- Paxos
CSE 486/586 Distributed Systems Consistency --- 3
October 9, 2013 Subjects & Predicates.
CSE 486/586 Distributed Systems Case Study: Amazon Dynamo
Presentation transcript:

Dennis Kafura – CS5204 – Operating Systems Quorum Protocol Dennis Kafura – CS5204 – Operating Systems

Dennis Kafura – CS5204 – Operating Systems A scenario Alice and Bob have 10 friends that they see on a regular basis, but not each friend every day. As she meets them, Alice begins telling these friends something she wants Bob to know. Alice shares the information with 6 friends. Later, Bob – expecting to hear from Alice – begins asking these friends if they have heard from Alice. How many friends must Bob ask to be guaranteed of receiving the information from Alice? Dennis Kafura – CS5204 – Operating Systems

Dennis Kafura – CS5204 – Operating Systems A scenario Alice and Bob have N friends that they see on a regular basis, but not each friend every day. As she meets them, Alice begins telling these friends something she wants Bob to know. Alice shares the information with W friends. Later, Bob – expecting to hear from Alice – begins asking these friends if they have heard from Alice. How many friends, R, must Bob ask to be guaranteed of receiving the information from Alice? Dennis Kafura – CS5204 – Operating Systems

Replication and Quorums Replication improves reliability and performance. Reliability: increased probability of an available replica Performance: read most quickly accessible replica However, availability may be lost If all replicas must be updated and a replica is unavailable (failure, network partition, overload) Client must wait until all replicas available Solution: reads must obtain R replicas writes must update W replicas even if not all N replicas are available Problem: inconsistency may arise if R and W are not chosen carefully. Dennis Kafura – CS5204 – Operating Systems

Dennis Kafura – CS5204 – Operating Systems Loss of Consistency W + R  N W: writes R: reads 1 . . . 2 2 2 N Dennis Kafura – CS5204 – Operating Systems

Dennis Kafura – CS5204 – Operating Systems Quorum Consistency W + R  N W: writes R: reads 1 . . . 2 2 2 N Dennis Kafura – CS5204 – Operating Systems

Dennis Kafura – CS5204 – Operating Systems Quorum Consistency W + R N W: writes R: reads 1 . . . 2 2 2 2 N Dennis Kafura – CS5204 – Operating Systems