Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct

A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the same identifiers. Under the assumption that the process identifiers are chromatic, this paper proposes two self-stabilizing local mutual exclusion algorithms; one assumes a tree as the topology of communication network and requires 3 states per process, while the other which works on any communication network, requires n + 1 states per process, where n is the number of processes in the system. We also show that the process identifiers being chromatic is close to necessary for a system to have a self-stabilizing local mutual exclusion algorithm. We adopt the shared memory model for communication and the unfair distributed daemon for process scheduling.

[1]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

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

[3]  Shing-Tsaan Huang.  The Fuzzy Philosophers , 2000, IPDPS Workshops.

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

[5]  Mohamed G. Gouda,et al.  The Triumph and Tribulation of System Stabilization , 1995, WDAG.

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

[7]  Masafumi Yamashita,et al.  Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct , 1999, IEEE Trans. Parallel Distributed Syst..

[8]  Hirotsugu Kakugawa,et al.  Lock-based self-stabilizing distributed mutual exclusion algorithms , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

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

[10]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 1999, DISC.

[11]  Felix C. Freiling,et al.  Fundamentals of Fault-Tolerant Distributed Computing in Asynchronous Environments , 1999, ACM Comput. Surv..

[12]  Shing-Tsaan Huang,et al.  Leader election in uniform rings , 1993, TOPL.

[13]  Felix C. Gärtner,et al.  Fundamentals of fault-tolerant distributed computing in asynchronous environments , 1999, CSUR.

[14]  Masafumi Yamashita,et al.  Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[15]  Marco Schneider,et al.  Self-stabilization , 1993, CSUR.

[16]  Ajoy Kumar Datta,et al.  Self-Stabilizing Local Mutual Exclusion and Daemon Refinement , 2000, Chic. J. Theor. Comput. Sci..

[17]  Sébastien Tixeuil,et al.  Self-stabilizing Vertex Coloring of Arbitrary Graphs , 2000 .

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

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

[20]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[21]  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.