Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity

  • Gheorghe Antonoiu
  • Pradip K. Srimani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1685)


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 [1], our protocol does not use time-stamps (which are basically unbounded in tegers); our protocol is a generalization of the protocol described in [2] which was restricted to work only for tree structured distributed systems. Like the protocol in [2],our algorithm uses only bounded integers and can be easily implemented.


Span Tree Neighboring Node Critical Section Mutual Exclusion System Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    G. Antonoiu and P.K. Srimani. Mutual exclusion between neighboring nodes in a tree that stabilizes using read/write atomicity. In Proceedings of Euro-Par 98; Lecture Notes in Computer Science, volume LNCS 1470, pages 545–553, Springer Verlag, 1998.CrossRefGoogle Scholar
  3. 3.
    S. Sur and P.K. Srimani. A self-stabilizing distributed algorithm to construct BFS spanning tress of a symmetric graph. Parallel Processing Letters, 2(2,3):171–180, September 1992.CrossRefMathSciNetGoogle Scholar
  4. 4.
    N.S. Chen, H.P. Yu, and S.T. Huang. A self-stabilizing algorithm for constructing spanning trees. Inf. Processing Letters, 39(3):14–151, 1991.MathSciNetGoogle Scholar
  5. 5.
    A. Arora and M. Gouda. Distributed reset. IEEE Trans. Comput., 43(9):1026–1038, September 1994.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gheorghe Antonoiu
    • 1
  • Pradip K. Srimani
    • 1
  1. 1.Department of Computer ScienceColorado State UniversityFt. Collins

Personalised recommendations