From Self- to Snap- Stabilization Alain Cournier, Stéphane Devismes, and Vincent Villain SSS’2006, November 17-19, Dallas (USA)

Slides:



Advertisements
Similar presentations
Impossibility of Distributed Consensus with One Faulty Process
Advertisements

Chapter 6 - Convergence in the Presence of Faults1-1 Chapter 6 Self-Stabilization Self-Stabilization Shlomi Dolev MIT Press, 2000 Shlomi Dolev, All Rights.
Chapter 7 - Local Stabilization1 Chapter 7: roadmap 7.1 Super stabilization 7.2 Self-Stabilizing Fault-Containing Algorithms 7.3 Error-Detection Codes.
Snap-stabilizing Committee Coordination Borzoo Bonakdarpour Stephane Devismes Franck Petit IEEE International Parallel and Distributed Processing Symposium.
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
Self Stabilizing Algorithms for Topology Management Presentation: Deniz Çokuslu.
Outline. Theorem For the two processor network, Bit C(Leader) = Bit C(MaxF) = 2[log 2 ((M + 2)/3.5)] and Bit C t (Leader) = Bit C t (MaxF) = 2[log 2 ((M.
Snap-Stabilizing Detection of Cutsets Alain Cournier, Stéphane Devismes, and Vincent Villain HIPC’2005, December , Goa (India)
Fast Leader (Full) Recovery despite Dynamic Faults Ajoy K. Datta Stéphane Devismes Lawrence L. Larmore Sébastien Tixeuil.
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS Fall 2011 Prof. Jennifer Welch CSCE 668 Self Stabilization 1.
Introduction to Self-Stabilization Stéphane Devismes.
Self-Stabilization: An approach for Fault-Tolerance in Distributed Systems Stéphane Devismes 16/12/2013MAROC'2013.
Chapter 8 - Self-Stabilizing Computing1 Chapter 8 – Self-Stabilizing Computing Self-Stabilization Shlomi Dolev MIT Press, 2000 Draft of January 2004 Shlomi.
CPSC 668Set 3: Leader Election in Rings1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
Chapter 4 - Self-Stabilizing Algorithms for Model Conservation4-1 Chapter 4: roadmap 4.1 Token Passing: Converting a Central Daemon to read/write 4.2 Data-Link.
CPSC 668Self Stabilization1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
Chapter 4 - Self-Stabilizing Algorithms for Model Conversions iddistance 22 iddistance iddistance iddistance.
CS294, YelickSelf Stabilizing, p1 CS Self-Stabilizing Systems
Self-Stabilization An Introduction Aly Farahat Ph.D. Student Automatic Software Design Lab Computer Science Department Michigan Technological University.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Fixed Parameter Complexity Algorithms and Networks.
Selected topics in distributed computing Shmuel Zaks
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Snap-Stabilizing PIF and Useless Computations Alain Cournier, Stéphane Devismes, and Vincent Villain ICPADS’2006, July , Minneapolis (USA)
CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 10 Instructor: Haifeng YU.
1 Self-stabilizing Algorithms and Frequency Assignment Problems.
Brief Announcement: Sorting on Skip Chains Ajoy K. Datta, Lawrence L. Larmore, and Stéphane Devismes.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
The Complexity of Distributed Algorithms. Common measures Space complexity How much space is needed per process to run an algorithm? (measured in terms.
A Self-Stabilizing O(n)-Round k-Clustering Algorithm Stéphane Devismes, VERIMAG.
1 Chapter 34: NP-Completeness. 2 About this Tutorial What is NP ? How to check if a problem is in NP ? Cook-Levin Theorem Showing one of the most difficult.
6.852: Distributed Algorithms Spring, 2008 Class 25-1.
Autonomic distributed systems. 2 Think about this Human population x10 9 computer population.
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)
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)
Weak vs. Self vs. Probabilistic Stabilization Stéphane Devismes (CNRS, LRI, France) Sébastien Tixeuil (LIP6-CNRS & INRIA, France) Masafumi Yamashita (Kyushu.
Hwajung Lee. Well, you need to capture the notions of atomicity, non-determinism, fairness etc. These concepts are not built into languages like JAVA,
Hwajung Lee. Why do we need these? Don’t we already know a lot about programming? Well, you need to capture the notions of atomicity, non-determinism,
Self-stabilization. What is Self-stabilization? Technique for spontaneous healing after transient failure or perturbation. Non-masking tolerance (Forward.
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
CS 542: Topics in Distributed Systems Self-Stabilization.
Sorting on Skip Chains Ajoy K. Datta, Lawrence L. Larmore, and Stéphane Devismes.
1 Fault tolerance in distributed systems n Motivation n robust and stabilizing algorithms n failure models n robust algorithms u decision problems u impossibility.
Self-stabilization. Technique for spontaneous healing after transient failure or perturbation. Non-masking tolerance (Forward error recovery). Guarantees.
Fault tolerance and related issues in distributed computing Shmuel Zaks GSSI - Feb
Self-Stabilizing Algorithm with Safe Convergence building an (f,g)-Alliance Fabienne Carrier Ajoy K. Datta Stéphane Devismes Lawrence L. Larmore Yvan Rivierre.
Hwajung Lee.  Technique for spontaneous healing.  Forward error recovery.  Guarantees eventual safety following failures. Feasibility demonstrated.
“Towards Self Stabilizing Wait Free Shared Memory Objects” By:  Hopeman  Tsigas  Paptriantafilou Presented By: Sumit Sukhramani Kent State University.
Fault tolerance and related issues in distributed computing Shmuel Zaks GSSI - Feb
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
Superstabilizing Protocols for Dynamic Distributed Systems Authors: Shlomi Dolev, Ted Herman Presented by: Vikas Motwani CSE 291: Wireless Sensor Networks.
ITEC452 Distributed Computing Lecture 15 Self-stabilization Hwajung Lee.
Self-stabilizing (f,g)-Alliances with Safe Convergence Fabienne Carrier Ajoy K. Datta Stéphane Devismes Lawrence L. Larmore Yvan Rivierre.
Snap-Stabilizing Depth-First Search on Arbitrary Networks Alain Cournier, Stéphane Devismes, Franck Petit, and Vincent Villain OPODIS 2004, December
Around Self-Stabilization Part 2: Strengthened Forms of Self-Stabilization Stéphane Devismes Post-Doc CNRS at the LRI (Paris VII)
CSE-591: Term Project Self-stabilizing Network Algorithms by Tridib Mukherjee ASU ID :
Fundamentals of Fault-Tolerant Distributed Computing In Asynchronous Environments Paper by Felix C. Gartner Graeme Coakley COEN 317 November 23, 2003.
Competitive Self-Stabilizing k-Clustering
Model and complexity Many measures Space complexity Time complexity
When Is Agreement Possible
第1部: 自己安定の緩和 すてふぁん どぅゔぃむ ポスドク パリ第11大学 LRI CNRS あどばいざ: せばすちゃ てぃくそい
New Variants of Self-Stabilization
Self-stabilization.
CS60002: Distributed Systems
A Snap-Stabilizing DFS with a Lower Space Requirement
Robust Stabilizing Leader Election
Physical clock synchronization
Introduction to Self-Stabilization
Snap-Stabilization in Message-Passing Systems
Presentation transcript:

From Self- to Snap- Stabilization Alain Cournier, Stéphane Devismes, and Vincent Villain SSS’2006, November 17-19, Dallas (USA)

From Self- to Snap- Stabilization2 Introduction  Self-stabilizing protocols → Snap-stabilizing protocols v Arbitrary rooted network v State model –Local shared memory –Daemon: weakly fair/unfair

From Self- to Snap- Stabilization3 Related Work Transformer [Cournier et al, 2003] in the state model: Non fault-tolerant → Snap-stabilizing –Use Snapshots to regulary test if the system is in a normal configuration –Drawbacks : u Define a predicat that caracterises the normal configuration u The number of snapshots is unboundable –Consequences : u the overcost of the transformer is difficult to evaluate u scheduling assumption (at most a weakly fair deamon)

From Self- to Snap- Stabilization4 Assumptions v The input protocol is: –Self-stabilizing –Single-initiator wave protocol (the root is the initiator) –Decision actions occur at the initiator only v Example: Token Circulation, PIF, Spanning tree construction (DFS or BFS)…

From Self- to Snap- Stabilization5 A self-stabilizing wave protocol converges to a specified behavior in a finite time. N is finite but generally unbounded Self- vs Snap- Stabilizing Wave Protocols 1.X ≠ F(X) F(.)2.X ≠ F(X) 3.X ≠ F(X) 4.X ≠ F(X) N.X F(X)

From Self- to Snap- Stabilization6 Self- vs Snap- Stabilizing Wave Protocols Since its first starting action (the real start of the protocol), a snap-stabilizing wave protocol works according to its specification. Consequence: a snap-stabilizing wave protocol do not require to be repeated. 1.X F(X) F(.)

From Self- to Snap- Stabilization7 More precisely Configurations Time RequestStarting Action A snap-stabilizing wave protocol for a task T verifies : Decision T is executed as expected

From Self- to Snap- Stabilization8 Our solution Let P’ be self-stabilizing wave protocol for a task T. We compose P’ with Reset protocol as follows : Configurations Time RequestStarting Action Decision P’ executes T One Reset

From Self- to Snap- Stabilization9 Our solution Problem: when a computation of T is requested : – The Reset must start in a finite time – But without aborting a previous initiated computation of T Solution: we use a boolean End r : –End r := True at the decision (as P’ is self-stabilizing, P’ eventually decides) –While End r = True, P’ cannot start a computation of T –End r := True causes a Reset of the P’ Variables –At the end of the Reset, End r := false

From Self- to Snap- Stabilization10 Snap-stabilizing Reset Using a snap-stabilizing PIF protocol : v 2 phases : broadcast and Feedback –The processors abort the computation of T when receiving the broadcast phase –The reset is performed during the feedback phase v The snap-stabilizing PIF of [Cournier et al, 2006] –Bounded step complexity (unfair deamon) This implies that the transformer works at least with the same deamon that the initial protocol

From Self- to Snap- Stabilization11 Case Study : DFTC of [Huang and Chen, 1993] R Correct behavior

From Self- to Snap- Stabilization12 Case Study : DFTC of [Huang and Chen, 1993] Starting for an abnormal initial configuration : v Abnormal successor paths –Correction : using a third color ERROR, the abnormal successor paths are paralysed before to be removed. v Problem : R Weakly Fair Deamon Can never move if the deamon is unfair

From Self- to Snap- Stabilization13 With the transformer … At least a weakly fair daemon R Unfair deamon End r Decision in a finite number of steps Reset in a finite number of steps Token circulation in a finite number of steps

From Self- to Snap- Stabilization14 Complexity ? Stabilization time of [Huang and Chen, 1993] :  (n  D) rounds R

From Self- to Snap- Stabilization15 Complexity with the transformer Decision : O(N) rounds Reset : O(N) rounds [Cournier et al, 2006] Token circulation : O(N) rounds R A correct Token circulation : O(N) rounds End r

From Self- to Snap- Stabilization16 Conclusion v Simple v Low memory overcost : memory requirement of the reset protocol (O(log N) bits) v At least the same scheduling assumption v In some cases: [Huang and Chen, 1993], [Johnen and Beauquier, 1995], [Datta et al, 1998]: –Better scheduling assumption (Weakly Fair → Unfair) –Better time complexity (  (n  D) rounds → O(N) rounds)

From Self- to Snap- Stabilization17 Perspective v Apply a similar technique to transform Non Fault-Tolerant Wave Protocols into Snap-Stabilizing Wave Protocols (done). v Multi-initiators

From Self- to Snap- Stabilization18 Thank you!