Fault-containing self-stabilization using priority scheduling

Schedulers play a vital role in the design of distributed algorithms. This paper introduces priority scheduling that can be used to design as well as reason about correctness proofs at a higher level of abstraction. The application of priority scheduling in solving problems related to stabilization and fault containment in spanning tree generation is presented. This paper also presents an implementation of the priority scheduling scheme.

[1]  Xin He,et al.  Scalable self-stabilization , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

[2]  Sukumar Ghosh,et al.  Stabilizing Phase-Clocks , 1995, Inf. Process. Lett..

[3]  Arobinda Gupta,et al.  An Exercise in Fault-Containment: Self-Stabilizing Leader Election , 1996, Inf. Process. Lett..

[4]  Boaz Patt-Shamir,et al.  Time-adaptive self stabilization , 1997, PODC '97.

[5]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[6]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Spanning Trees , 1991, Inf. Process. Lett..

[7]  Yehuda Afek,et al.  Local stabilizer , 1997, PODC '97.

[8]  Arobinda Gupta,et al.  Fault-containing self-stabilizing algorithms , 1996, PODC '96.

[9]  Shay Kutten,et al.  Fault-Local Distributed Mending , 1999, J. Algorithms.

[10]  Ted Herman,et al.  Superstabilizing mutual exclusion , 2000, Distributed Computing.