Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
M. Ahamad, M. H. Ammar and S. Y. Cheung, “Multi-Dimensional Voting,” Technical Report, College of Computing, Georgia Institute of Technology, 1991.
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.
B. A. Sanders, “The Information Structure of Distributed Mutual Exclusion Algorithms,” ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284–299, August 1987.'
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.
P. Erdos and J. Spencer, “Probabilistic Methods in Combinatorics,” Academic Press, 1974.
H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” JACM, vol. 32, no. 4, pp. 841–860, October 1985.
D. K. Gifford, “Weighted Voting for Replicated Data,” Proceedings of the Seventh Symposium on Operating System Principles, pp. 150–159, 1979.
L. Lamport, “The Implementation of Reliable Distributed Multiprocess Systems,” Computer Networks, no. 2, 1978, pp. 95–114.
L. Lamport, “Time, Clocks and the Ordering of Events in a Distributed System,” Comm. of ACM, vol. 21, no. 7, pp. 558–565, 1978.
M. Maekawa, “A √N Algorithm for Mutual Exclusion in Decentralized Systems,” ACM. Trans. Computer Systems, pp. 145–159, May 1985.
K. Raymond, “A Tree Based Algorithm for Mutual Exclusion,” ACM Transactions on Computer Systems, vol. 7, no. 1, pp. 61–77, February 1989.
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.
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.
I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Transactions on Computer Systems, vol. 3, no. 4, pp. 344–349, November 1985.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rangarajan, S., Tripathi, S.K. (1992). A robust distributed mutual exclusion algorithm. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds) Distributed Algorithms. WDAG 1991. Lecture Notes in Computer Science, vol 579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022455
Download citation
DOI: https://doi.org/10.1007/BFb0022455
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55236-9
Online ISBN: 978-3-540-46789-2
eBook Packages: Springer Book Archive