Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity
Our purpose in this paper is to propose a new protocol that can ensure mutual exclusion betw een neighboring nodes in an arbitrary 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”, “receiv e a message”, and “update a state”. Unlike the scheme in , our protocol does not use time-stamps (which are basically unbounded in tegers); our protocol is a generalization of the protocol described in  which was restricted to work only for tree structured distributed systems. Like the protocol in ,our algorithm uses only bounded integers and can be easily implemented.
KeywordsSpan Tree Neighboring Node Critical Section Mutual Exclusion System Graph
Unable to display preview. Download preview PDF.
- 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