A robust distributed mutual exclusion algorithm

  • Sampath Rangarajan
  • Satish K. TripathiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 579)


Correct operation of a distributed system with replicated resources requires that mutual exclusion be maintained among independent requests to these resources at different sites in the system. In this paper, we propose “asymptotically high resiliency” as a performance measure for fault-tolerant mutual exclusion algorithms for systems where sites can fail. We then present an efficient highly fault-tolerant algorithm for mutual exclusion. The algorithm is totally distributed in nature and is shown to have a message overhead of O(√ N log N) where N is the number of sites. The algorithm provides mutual exclusion with a resiliency (that is, probability that permission for a mutual exclusion request is obtained in spite of site failures) approaching 1 asymptotically with an increase in N.


Mutual Exclusion Message Complexity High Resiliency Message Overhead System Resiliency 
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]
    D. Agarawal and A. El Abbadi, “An Efficient Solution to the Mutual Exclusion Problem,” ACM Symposium on Principles of Distributed Computing, pp. 193–200, 1989.Google Scholar
  2. [2]
    M. Ahamad, M. H. Ammar and S. Y. Cheung, “Multi-Dimensional Voting,” Technical Report, College of Computing, Georgia Institute of Technology, 1991.Google Scholar
  3. [3]
    P. A. Alsberg and J. D. Day, “A Principle for Resilient Sharing of Distributed Resources,” Proceedings of the Second International Conference on Software Engineering, pp. 562–570, October 1976.Google Scholar
  4. [4]
    B. A. Sanders, “The Information Structure of Distributed Mutual Exclusion Algorithms,” ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284–299, August 1987.'Google Scholar
  5. [5]
    H. Chernoff, “A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations,” Annals of Mathematical Statistics, vol.23, pp. 493–507, 1952.Google Scholar
  6. [6]
    P. Erdos and J. Spencer, “Probabilistic Methods in Combinatorics,” Academic Press, 1974.Google Scholar
  7. [7]
    H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” JACM, vol. 32, no. 4, pp. 841–860, October 1985.Google Scholar
  8. [8]
    D. K. Gifford, “Weighted Voting for Replicated Data,” Proceedings of the Seventh Symposium on Operating System Principles, pp. 150–159, 1979.Google Scholar
  9. [9]
    L. Lamport, “The Implementation of Reliable Distributed Multiprocess Systems,” Computer Networks, no. 2, 1978, pp. 95–114.Google Scholar
  10. [10]
    L. Lamport, “Time, Clocks and the Ordering of Events in a Distributed System,” Comm. of ACM, vol. 21, no. 7, pp. 558–565, 1978.Google Scholar
  11. [11]
    M. Maekawa, “A √N Algorithm for Mutual Exclusion in Decentralized Systems,” ACM. Trans. Computer Systems, pp. 145–159, May 1985.Google Scholar
  12. [12]
    K. Raymond, “A Tree Based Algorithm for Mutual Exclusion,” ACM Transactions on Computer Systems, vol. 7, no. 1, pp. 61–77, February 1989.Google Scholar
  13. [13]
    G. Ricart and A. K. Agarwala, “An Optimal Algorithm for Mutual Exclusion in Computer Networks,” Communication of the ACM, vol. 24, no. 1, pp. 9–17, January, 1981.Google Scholar
  14. [14]
    D. Skeen, “A Quorum Based Commit Protocol,” Proceedings of the 6th Berkeley Workshop on Distributed Data Management and Computer Networks, pp. 69–80, February, 1982.Google Scholar
  15. [15]
    I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Transactions on Computer Systems, vol. 3, no. 4, pp. 344–349, November 1985.Google Scholar
  16. [16]
    R. H. Thomas, “A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases,” ACM Transactions on Database Systems, vol. 4, no. 2, pp. 180–209, June 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  1. 1.Institute for Advanced Computer StudiesUniversity of MarylandCollege Park

Personalised recommendations