Snap-Stabilizing Committee Coordination Borzoo Bonakdarpour, Stéphane Devismes, and Frank Petit.

Slides:



Advertisements
Similar presentations
CS 603 Process Synchronization: The Colored Ticket Algorithm February 13, 2002.
Advertisements

CS3771 Today: deadlock detection and election algorithms  Previous class Event ordering in distributed systems Various approaches for Mutual Exclusion.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Concurrency Control Chapter 17 Sections
1 CS 194: Elections, Exclusion and Transactions Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.
Failure Detection The ping-ack failure detector in a synchronous system satisfies – A: completeness – B: accuracy – C: neither – D: both.
Snap-stabilizing Committee Coordination Borzoo Bonakdarpour Stephane Devismes Franck Petit IEEE International Parallel and Distributed Processing Symposium.
Process Synchronization Continued 7.2 The Critical-Section Problem.
Mutual Exclusion By Shiran Mizrahi. Critical Section class Counter { private int value = 1; //counter starts at one public Counter(int c) { //constructor.
Concurrent Programming Problems OS Spring Concurrency pros and cons Concurrency is good for users –One of the reasons for multiprogramming Working.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 5: Process Synchronization.
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems (m, k)-firm tasks and QoS enhancement.
Snap-Stabilizing Detection of Cutsets Alain Cournier, Stéphane Devismes, and Vincent Villain HIPC’2005, December , Goa (India)
1 Algorithms and protocols for distributed systems We have defined process groups as having peer or hierarchical structure and have seen that a coordinator.
Introduction to Self-Stabilization Stéphane Devismes.
10. Petri Nets Prof. O. Nierstrasz. Roadmap  Definition: —places, transitions, inputs, outputs —firing enabled transitions  Modelling: —concurrency.
What we will cover…  Distributed Coordination 1-1.
Session - 14 CONCURRENCY CONTROL CONCURRENCY TECHNIQUES Matakuliah: M0184 / Pengolahan Data Distribusi Tahun: 2005 Versi:
CS603 Process Synchronization February 11, Synchronization: Basics Problem: Shared Resources –Generally data –But could be others Approaches: –Model.
Synchronization in Distributed Systems. Mutual Exclusion To read or update shared data, a process should enter a critical region to ensure mutual exclusion.
Chapter 18: Distributed Coordination (Chapter 18.1 – 18.5)
Coordination in Distributed Systems Lecture # 8. Coordination Anecdotes  Decentralized, no coordination  Aloha ~ 18%  Some coordinating Master  Slotted.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Operating Systems CMPSCI 377 Lecture.
Distributed Systems Fall 2009 Distributed transactions.
Election Algorithms and Distributed Processing Section 6.5.
1 Lecture 9: Synchronization  concurrency examples and the need for synchronization  definition of mutual exclusion (MX)  programming solutions for.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Parallel Programming Philippas Tsigas Chalmers University of Technology Computer Science and Engineering Department © Philippas Tsigas.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved Chapter 6 Synchronization.
Selected topics in distributed computing Shmuel Zaks
4.5 DISTRIBUTED MUTUAL EXCLUSION MOSES RENTAPALLI.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Probabilistic Methods in Concurrency Lecture 4 Problems in distributed systems for which only randomized solutions exist Catuscia Palamidessi
4.5 Distributed Mutual Exclusion Ranjitha Shivarudraiah.
Snap-Stabilizing PIF and Useless Computations Alain Cournier, Stéphane Devismes, and Vincent Villain ICPADS’2006, July , Minneapolis (USA)
CS425 /CSE424/ECE428 – Distributed Systems – Fall 2011 Material derived from slides by I. Gupta, M. Harandi, J. Hou, S. Mitra, K. Nahrstedt, N. Vaidya.
Elections in a Distributed Computing System Hector Garcia-Molina Presenter: Srinath Rao.
Presenter: Long Ma Advisor: Dr. Zhang 4.5 DISTRIBUTED MUTUAL EXCLUSION.
Self-Stabilizing K-out-of-L Exclusion on Tree Networks Stéphane Devismes, VERIMAG Joint work with: – Ajoy K. Datta (Univ. Of Nevada) – Florian Horn (LIAFA)
Studying Different Problems from Distributed Computing Several of these problems are motivated by trying to use solutiions used in `centralized computing’
Self-Stabilizing K-out-of-L Exclusion on Tree Networks Stéphane Devismes, VERIMAG Joint work with: – Ajoy K. Datta (Univ. Of Nevada) – Florian Horn (LIAFA)
Distributed systems Consensus Prof R. Guerraoui Distributed Programming Laboratory.
Distributed Transaction Management, Fall 2002Lecture 2 / Distributed Locking Jyrki Nummenmaa
Transaction Management Overview. Transactions Concurrent execution of user programs is essential for good DBMS performance. – Because disk accesses are.
1.Mutual Exclusion in Distributed Systems 2.Non-Token-Based Algorithms 3.Token-Based Algorithms 4.Distributed Election 5.The Bully and the Ring-Based Algorithms.
SysRép / 2.5A. SchiperEté The consensus problem.
U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science Computer Systems Principles Synchronization Emery Berger and Mark Corner University.
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Lecture 12-1 Computer Science 425 Distributed Systems CS 425 / CSE 424 / ECE 428 Fall 2012 Indranil Gupta (Indy) October 4, 2012 Lecture 12 Mutual Exclusion.
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
Snap-Stabilizing Depth-First Search on Arbitrary Networks Alain Cournier, Stéphane Devismes, Franck Petit, and Vincent Villain OPODIS 2004, December
Distributed Transactions What is a transaction? (A sequence of server operations that must be carried out atomically ) ACID properties - what are these.
4.5 Distributed Mutual Exclusion
Bakery Algorithm - Proof
CSE 120 Principles of Operating
Background on the need for Synchronization
Mutual Exclusion Continued
143a discussion session week 3
Commit Protocols CS60002: Distributed Systems
Distributed Systems, Consensus and Replicated State Machines
Lecture 21: Synchronization and Consistency
Lecture: Coherence and Synchronization
CS333 Intro to Operating Systems
Introduction to Self-Stabilization
Lecture: Coherence and Synchronization
Distributed Systems and Concurrency: Synchronization in Distributed Systems Majeed Kassis.
Distributed systems Consensus
Distributed Mutual eXclusion
CSE 486/586 Distributed Systems Leader Election
Presentation transcript:

Snap-Stabilizing Committee Coordination Borzoo Bonakdarpour, Stéphane Devismes, and Frank Petit

Committee Coordination Cap Estérel, mardi 24 mai 2011, ALGOTEL'2011 2

Committee Coordination Cap Estérel, mardi 24 mai 2011, ALGOTEL' Synchronization Wait

Committee Coordination Cap Estérel, mardi 24 mai 2011, ALGOTEL' Exclusion

Committee Coordination Cap Estérel, mardi 24 mai 2011, ALGOTEL' Progress Wait

Snap-Stabilization Cap Estérel, mardi 24 mai 2011, ALGOTEL'2011 6

Related property: Self-Stabilization Cap Estérel, mardi 24 mai 2011, ALGOTEL'2011 7

Other properties Maximal Concurrency Fairness 2-phase discussion time Cap Estérel, mardi 24 mai 2011, ALGOTEL'2011 8

Maximal Concurrency Cap Estérel, mardi 24 mai 2011, ALGOTEL' Wait

(Professor) Fairness May 17, 2011 IEEE International Parallel and Distributed Processing Symposium (IPDPS'11) Every professor eventually participates in a committee meeting that it is a member of. Assumption [2]) (otherwise, impossible [2]) Fairness [2] Y.-K. Tsay and R. Bagrodia. Some impossibility results in interprocess synchronization. Distributed Computing, 6(4):221–231, Every professor wants to participate in a committee meeting infinitely often.

Impossibility of Fairness and Maximal Concurrency Cap Estérel, mardi 24 mai 2011, ALGOTEL' Wait We design an algorithm for each property

2-Phase Discussion Time Before: atomic event assumption – All members start and finished the meeting simultaneously 2-Phase discussion: – Phase 1 (essential discussion) : all participants must discuss – Phase 2 (voluntary discussion) : participants discuss freely The meeting ends when any participant decide to leave the meeting Cap Estérel, mardi 24 mai 2011, ALGOTEL'

Algorithms Snap-stabilizing 2-Phase Committee Coordination with Maximal Concurrency Snap-stabilizing 2-Phase Fair Committee Coordination Cap Estérel, mardi 24 mai 2011, ALGOTEL'

Snap-stabilizing 2-Phase Committee Coordination with Maximal Concurrency Cap Estérel, mardi 24 mai 2011, ALGOTEL' Step 1: Looking for a committee to participate L L L L L L L

Snap-stabilizing 2-Phase Committee Coordination with Maximal Concurrency Cap Estérel, mardi 24 mai 2011, ALGOTEL' Step 2: Choosing a committee where all members are also looking L L L L L L L

Snap-stabilizing 2-Phase Committee Coordination with Maximal Concurrency Step 3: Getting ready to participate in a meeting Cap Estérel, mardi 24 mai 2011, ALGOTEL'2011 L L L L L L L Ok

Snap-stabilizing 2-Phase Committee Coordination with Maximal Concurrency Cap Estérel, mardi 24 mai 2011, ALGOTEL' Step 4: Committee meeting convenes Ok L L L

Snap-stabilizing 2-Phase Committee Coordination with Maximal Concurrency 18 Step 5: After essential discussion, professors leave the meeting Cap Estérel, mardi 24 mai 2011, ALGOTEL' Ok L L L D D D D

Snap-stabilizing 2-Phase Fair CC Selection of the committee: ID ? Cap Estérel, mardi 24 mai 2011, ALGOTEL' L L L L L L OkD D D D

Snap-stabilizing 2-Phase Fair CC Selection of the committee: Token-Based Priority (1/2) Let P, Q be processes If P hold a token, but not Q, then – P has a higher than Q Otherwise – Priorities are given by the IDs Cap Estérel, mardi 24 mai 2011, ALGOTEL'

Snap-stabilizing 2-Phase Fair CC Selection of the committee: Token-Based Priority (1/2) Cap Estérel, mardi 24 mai 2011, ALGOTEL' L L L L L OkD D D D T T L

When release the token ? Cap Estérel, mardi 24 mai 2011, ALGOTEL' L L L L L T If the token holder has no guarantee to eventually convene a meeting, it releases the token

Snap-stabilizing 2-Phase Fair Committee Coordination Recall: Every professor wants to participate in a committee meeting infinitely often. (required assumption) Mainly differ by the way the token is handled: – The token holder only releases the token at the end a meeting Cap Estérel, mardi 24 mai 2011, ALGOTEL'

Locked Professors Cap Estérel, mardi 24 mai 2011, ALGOTEL' L L L Ok L T Locked

Concurrency: Algo 1 vs. Algo 2 Algo 1: Maximal matching Algo 2: almost… Cap Estérel, mardi 24 mai 2011, ALGOTEL' L L Ok L T Locked

Conclusion Summary – We considered the distributed committee coordination problem – We showed that satisfying fairness and maximal concurrency is impossible even if professors desire to participate in meetings infinitely often – We proposed a snap-stabilizing algorithms for each conflicting property. Future work – Dynamic join / leave of professor – Priorities on committee Cap Estérel, mardi 24 mai 2011, ALGOTEL'