390 likes | 399 Views
This paper introduces a snap-stabilizing DFS (Depth-First Search) protocol with a lower memory requirement. It guarantees convergence to the intended behavior in finite time. The protocol is designed for arbitrary rooted networks and uses a state model and local shared memory.
E N D
SSS’2005, October 26-27 2005, Barcelona (Spain) A Snap-Stabilizing DFS with a Lower Space Requirement Alain Cournier, Stéphane Devismes, and Vincent Villain
Snap-Stabilizing System? • A particular class of self-stabilizing systems. • (A self-stabilizing system, regardless of the initial state of the processors, is guaranteed to converge to the intended behavior in finite time. (Dijkstra 1974)) A snap-stabilizing system, regardless of the initial state of the processors, always behaves according to its specifications. (Bui et al, 1999) A Snap-Stabilizing DFS with a Lower Space Requirement
Model • Arbitrary rooted network • State model • Local shared memory • Daemon: weakly fair/unfair R A Snap-Stabilizing DFS with a Lower Space Requirement
O(NN) states (Ids List) Related Works • Self-stabilizing area: • Huang and Chen (Distributed Computing, 1993) • Johnen and Beauquier (WSS, 1995) • Johnen et al (WDAG, 1997) • Datta et al (Distributed Computing, 2000) • Snap-stabilizing area: • Cournier et al, Transformer (ICDCS, 2003) • Cournier et al (OPODIS, 2004) Weakly fair Daemon Unfair Daemon A Snap-Stabilizing DFS with a Lower Space Requirement
Write a snap-stabilizing unfair DFS protocol with a lower memory requirement (no Ids) A Snap-Stabilizing DFS with a Lower Space Requirement
DFS in a non-faulty configuration R A Snap-Stabilizing DFS with a Lower Space Requirement
Visited for the 2nd time Problem of the cleaning by the leaves r A Snap-Stabilizing DFS with a Lower Space Requirement
Problem of the cleaning by the leaves r ... ... A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: cleaning at the end of the traversal only r A Snap-Stabilizing DFS with a Lower Space Requirement
Insuring the visit of all the processors A Snap-Stabilizing DFS with a Lower Space Requirement
Insuring the visit of all the processors r A Snap-Stabilizing DFS with a Lower Space Requirement
Insuring the visit of all the processors Processors never visited r Not Snap-stabilizing! A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: a Question Mecanism • [Blin et al, An Improved Snap-Stabilizing PIF Algorithm, 2003] Can I switch to the red color? Only the root can deliver an answer and this answer is propagated in the spanning tree of the root only A Snap-Stabilizing DFS with a Lower Space Requirement
Insuring the visit of all the processors Ok Ok Ok Ok Ok Ok r Ok A Snap-Stabilizing DFS with a Lower Space Requirement
Insuring the visit of all the processors r Ok Ok Ok The yellow processor waits Until the abnormal traversal disappears by Error Correction A Snap-Stabilizing DFS with a Lower Space Requirement
Error Correction 1 7 2 8 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 1 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 2 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 3 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 6 R 5 4 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 6 R 5 A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism 6 R A Snap-Stabilizing DFS with a Lower Space Requirement
Solution: Paralyzing Mechanism R A Snap-Stabilizing DFS with a Lower Space Requirement
Conclusion • Snap-Stabilizing • Arbitrary Rooted Networks • Unfair Daemon A Snap-Stabilizing DFS with a Lower Space Requirement
Conclusion: SSS’05 vs OPODIS’04 A Snap-Stabilizing DFS with a Lower Space Requirement
Perspective • Finding an efficient solution in both time and space complexities A Snap-Stabilizing DFS with a Lower Space Requirement
Thank You! A Snap-Stabilizing DFS with a Lower Space Requirement