Euro-Par 1998: Euro-Par’98 Parallel Processing pp 545-553 | Cite as
Mutual exclusion between neighboring nodes in a tree that stabilizes using read/write atomicity
Abstract
Our purpose in this paper is to propose a new protocol that can ensure mutual exclusion between neighboring nodes in a tree structured distributed system, i.e., under the given protocol no two neighboring nodes can execute their critical sections concurrently. This protocol can be used to run a serial model self stabilizing algorithm in a distributed environment that accepts as atomic operations only send a message, receive a message an update a state. Unlike the scheme in [1], our protocol does not use time-stamps (which are basically unbounded integers); our algorithm uses only bounded integers (actually, the integers can assume values only 0, 1, 2 and 3) and can be easily implemented.
Keywords
Root Node Leaf Node Neighboring Node Critical Section Mutual ExclusionPreview
Unable to display preview. Download preview PDF.
References
- 1.M. Mizuno and H. Kakugawa. A timestamp based transformation of self-stabilizing programs for distributed computing environments. In Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG’96), volume 304–321, 1996.Google Scholar
- 2.S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3–16, 1993.CrossRefGoogle Scholar
- 3.M. Raynal. Algorithms for Mutual Exclusion. MIT Press, Cambridge MA, 1986.Google Scholar
- 4.P. K. Srimani and S. R. Das, editors. Distributed Mutual Exclusion Algorithms. IEEE Computer Society Press, Los Alamitos, CA, 1992.Google Scholar
- 5.M. Flatebo, A. K. Datta, and A. A. Schoone. Self-stabilizing multi-token rings. Distributed Computing, 8:133–142, 1994.CrossRefGoogle Scholar
- 6.S. T. Huang and N. S. Chen. Self-stabilizing depth-first token circulation on networks. Distributed Computing, 1993.Google Scholar
- 7.E. W. Dijkstra. Solution of a problem in concurent programming control. Communication of the ACM, 8(9):569, September 1965.CrossRefGoogle Scholar
- 8.L. Lamport. A new solution of Dijkstra’s concurrent programming problem. Communications of the ACM, 17(8):107–118, August 1974.MathSciNetCrossRefGoogle Scholar
- 9.L. Lamport. The mutual exclusion problem: Part II — statement and solutions. Journal of the ACM, 33(2):327–348, 1986.MATHMathSciNetCrossRefGoogle Scholar
- 10.H. S. M. Kruijer. Self-stabilization (in spite of distributed control) in tree-structured systems. Inf. Processing Letters, 8(2):91–95, 1979.MATHMathSciNetCrossRefGoogle Scholar