Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon

This paper presents a uniform randomized self-stabilizing mutual exclusion algorithm for an anonymous unidirectional ring of any size n, running under an unfair distributed scheduler (d-daemon). The system is stabilized with probability 1 in O(n3) expected number of steps, and each process is privileged at least once in every 2n steps, once it is stabilized.

[1]  Edsger W. Dijkstra,et al.  Self stabilization in spite of distributed control , 1974 .

[2]  Ted Herman,et al.  Probabilistic Self-Stabilization , 1990, Information Processing Letters.

[3]  Mohamed G. Gouda,et al.  The Stabilizing Token Ring in Three Bits , 1996, J. Parallel Distributed Comput..

[4]  Shing-Tsaan Huang,et al.  Distributed execution model for self-stabilizing systems , 1994, 14th International Conference on Distributed Computing Systems.

[5]  Amos Israeli,et al.  Token management schemes and random walks yield self-stabilizing mutual exclusion , 1990, PODC '90.

[6]  Hirotsugu Kakugawa,et al.  Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon , 1997, IEEE Trans. Parallel Distributed Syst..

[7]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[8]  Janos Simon,et al.  Observing self-stabilization , 1992, PODC '92.

[9]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[10]  Pradip K. Srimani,et al.  Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity , 1998, Euro-Par.

[11]  W DijkstraEdsger.  Self-stabilizing systems in spite of distributed control , 1974 .

[12]  Joffroy Beauquier,et al.  Probabilistic self-stabilizing mutual exclusion in uniform rings , 1994, PODC '94.

[13]  Pradip K. Srimani,et al.  Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity , 1999, Euro-Par.

[14]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[15]  Edsger W. Dijkstra,et al.  Selected Writings on Computing: A personal Perspective , 1982, Texts and Monographs in Computer Science.

[16]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[17]  Ajoy Kumar Datta,et al.  Self-stabilizing mutual exclusion using unfair distributed scheduler , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[18]  Hirotsugu Kakugawa,et al.  A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments , 1996, WDAG.

[19]  Shmuel Katz,et al.  Self-stabilizing extensions for message-passing systems , 1990, PODC '90.

[20]  Joep L. W. Kessels,et al.  An Exercise in Proving Self-Stabilization with a Variant Function , 1988, Information Processing Letters.

[21]  Jan K. Pachl,et al.  Uniform self-stabilizing rings , 1988, TOPL.