1 © R. Guerraoui Object implementations out of faulty base objects Prof R. Guerraoui Distributed Programming Laboratory.

Slides:



Advertisements
Similar presentations
1 © R. Guerraoui Universal constructions R. Guerraoui Distributed Programming Laboratory.
Advertisements

CS 603 Process Synchronization: The Colored Ticket Algorithm February 13, 2002.
1 © R. Guerraoui The Limitations of Registers R. Guerraoui Distributed Programming Laboratory.
CS 542: Topics in Distributed Systems Diganta Goswami.
CS425 /CSE424/ECE428 – Distributed Systems – Fall 2011 Material derived from slides by I. Gupta, M. Harandi, J. Hou, S. Mitra, K. Nahrstedt, N. Vaidya.
© 2005 P. Kouznetsov Computing with Reads and Writes in the Absence of Step Contention Hagit Attiya Rachid Guerraoui Petr Kouznetsov School of Computer.
DISTRIBUTED SYSTEMS II FAULT-TOLERANT BROADCAST Prof Philippas Tsigas Distributed Computing and Systems Research Group.
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Leader Election Steve Ko Computer Sciences and Engineering University at Buffalo.
The weakest failure detector question in distributed computing Petr Kouznetsov Distributed Programming Lab EPFL.
1 Distributed systems Causal Broadcast Prof R. Guerraoui Distributed Programming Laboratory.
CS 5204 – Operating Systems1 Paxos Student Presentation by Jeremy Trimble.
1 © R. Guerraoui The Power of Registers Prof R. Guerraoui Distributed Programming Laboratory.
CPSC 668Set 18: Wait-Free Simulations Beyond Registers1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
1 © R. Guerraoui Implementing the Consensus Object with Timing Assumptions R. Guerraoui Distributed Programming Laboratory.
What is ’’hard’’ in distributed computing? R. Guerraoui EPFL/MIT joint work with. Delporte and H. Fauconnier (Univ of Paris)
1 © R. Guerraoui - Shared Memory - R. Guerraoui Distributed Programming Laboratory lpdwww.epfl.ch.
 Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 7: Failure Detectors.
CPSC 668Set 9: Fault Tolerant Consensus1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
CPSC 668Set 9: Fault Tolerant Consensus1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
1 Principles of Reliable Distributed Systems Recitation 8 ◊S-based Consensus Spring 2009 Alex Shraer.
CS 425 / ECE 428 Distributed Systems Fall 2014 Indranil Gupta (Indy) Lecture 19: Paxos All slides © IG.
Distributed Systems Terminating Reliable Broadcast Prof R. Guerraoui Distributed Programming Laboratory.
 Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 7: Failure Detectors.
Midterm Exam 06: Exercise 2 Atomic Shared Memory.
 Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 8: Failure Detectors.
1 © R. Guerraoui Seth Gilbert Professor: Rachid Guerraoui Assistants: M. Kapalka and A. Dragojevic Distributed Programming Laboratory.
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS Fall 2011 Prof. Jennifer Welch CSCE 668 Set 18: Wait-Free Simulations Beyond Registers 1.
1 © R. Guerraoui Concurrent Algorithms (Overview) Prof R. Guerraoui Distributed Programming Laboratory.
DISTRIBUTED ALGORITHMS AND SYSTEMS Spring 2014 Prof. Jennifer Welch Set 11: Asynchronous Consensus 1.
1 © R. Guerraoui Regular register algorithms R. Guerraoui Distributed Programming Laboratory lpdwww.epfl.ch.
Lecture 11-1 Computer Science 425 Distributed Systems CS 425 / CSE 424 / ECE 428 Fall 2010 Indranil Gupta (Indy) September 28, 2010 Lecture 11 Leader Election.
1 © R. Guerraoui Registers Prof R. Guerraoui Distributed Programming Laboratory.
Asynchronous Exclusive Selection Bogdan Chlebus, U. Colorado Darek Kowalski, U. Liverpool.
DISTRIBUTED ALGORITHMS Spring 2014 Prof. Jennifer Welch Set 9: Fault Tolerant Consensus 1.
“Distributed Algorithms” by Nancy A. Lynch SHARED MEMORY vs NETWORKS Presented By: Sumit Sukhramani Kent State University.
CSE 486/586 CSE 486/586 Distributed Systems Leader Election Steve Ko Computer Sciences and Engineering University at Buffalo.
1 © R. Guerraoui Set-Agreement (Generalizing Consensus) R. Guerraoui.
Group Communication A group is a collection of users sharing some common interest.Group-based activities are steadily increasing. There are many types.
CSE 486/586, Spring 2014 CSE 486/586 Distributed Systems Paxos Steve Ko Computer Sciences and Engineering University at Buffalo.
Reliable multicast Tolerates process crashes. The additional requirements are: Only correct processes will receive multicasts from all correct processes.
The consensus problem in distributed systems
CSE 486/586 Distributed Systems Leader Election
CS 525 Advanced Distributed Systems Spring 2013
Atomic register algorithms
Lecture 17: Leader Election
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS
Computing with anonymous processes
Distributed systems Total Order Broadcast
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS
CS 525 Advanced Distributed Systems Spring 2018
Sequence Diagrams Getting the Message.
CS 425 / ECE 428 Distributed Systems Fall 2017 Indranil Gupta (Indy)
EEC 688/788 Secure and Dependable Computing
CSE 486/586 Distributed Systems Leader Election
Consensus, FLP, and Paxos
EEC 688/788 Secure and Dependable Computing
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS
EEC 688/788 Secure and Dependable Computing
EEC 688/788 Secure and Dependable Computing
Distributed systems Causal Broadcast
Constructing Reliable Registers From Unreliable Byzantine Components
- Atomic register specification -
R. Guerraoui Distributed Programming Laboratory lpdwww.epfl.ch
Lecture 11: Coordination and Agreement
Computing with anonymous processes
Distributed systems Consensus
Distributed Systems Terminating Reliable Broadcast
R. Guerraoui Distributed Programming Laboratory lpdwww.epfl.ch
CSE 486/586 Distributed Systems Leader Election
Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers
Presentation transcript:

1 © R. Guerraoui Object implementations out of faulty base objects Prof R. Guerraoui Distributed Programming Laboratory

2 Failure modes Responsive: once , forever  Non-responsive: no reply NB. In the asynchronous model, it is impossible to distinguish a non-responsive failed object from a slow object

3 Register implementations Algorithm 1: implements a SWMR register out of t+1 SWMR base responsive failure- prone registers Algorithm 2: implements a SWSR register out of 2t+1 SWSR base non-responsive failure-prone registers Algorithm 3: implements a C&S object out of t+1 base responsive failure-prone C&S

4 Responsive model Write(v) For j = 1 to (t+1) do Reg  j .write(v); return(ok) Read() For j = t+1 to 1 do v := Reg  j .read(); if v ≠  then return(v)

5 Non-responsive model Init: seq := 1 Write(v) w_seq := w_seq + 1; For j = 1 to (2t+1) do l l: Reg  j .write(w_seq, v); « wait until a majority of oks are returned » return(ok)

6 Non-responsive model Init: (sn,val) := (-1,  ); Read() For j = 1 to (2t+1) do l l: (s,v) := Reg  j .read(); (sn,val) := (s,v) with the highest s from majority, including (sn,val) return (val)

7 Responsive model (single-shot compare&swap) C&S(v) r := v; for j = 1 to t+1 do r' := CS[j].C&S(r); if r' ≠  then r := r’; return(r)

8 Exercises (1) Is it possible to build a C&S with base C&S objects among which one can be non- responsive? (2) Build a SWMR register that tolerates t non-responsive base SWMR registers