Abstract
A generalization of the majority quorum for the solution of the distributed (k+1)-exclusion problem is proposed. This scheme produces a family of quorums of varying sizes and availabilities indexed by integral divisors r of k. The cases r=1 and r=k correspond to known majority based quorum generation algorithms MAJ and DIV, whereas intermediate values of r interpolate between these two extremes. A cost and availability analysis of the proposed methods is also presented.
Supported in part by the NSF under grant number IRI94-11330, by the NASA under grant number NAGW-3888.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Agrawal and A. El Abbadi. Exploiting Logical Structures of Replicated Databases. IPL, 33(5):255–260, Jan. 1990.
M. Ahamad and M. H. Ammar. Performance Characterization of Quorum-Consensus Algorithms for Replicated Data. IEEE Trans. on Software Engineering, 15(4):492–495, Apr. 1989.
D. Cohen. Basic Techniques of Combinatorial Theory. John Wiley & Sons, 1978.
S. Fujita, M. Yamashita, and T. Ae. Distributed k-mutual exclusion problem and k-coteries. In Proc. on the Symp. on Algorithms, pp. 22–31, 1991.
H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. J. of the ACM, 32(4):841–860, Oct. 1985.
D. K. Gifford. Weighted Voting for Replicated Data. In Proc. of 7th ACM Symp. on Operating Systems Principles, pp. 150–159, Dec. 1979.
S. Huang, J. Jiang, and Y. Kuo. K-coteries for fault-tolerant k entries to a critical section. In Proc. of 13th Int. Conf. on Dist. Comp. Sys., pp. 74–81, June 1993.
H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae. Availability of k-Coteries. IEEE Trans. on Computers, 42(5):553–558, May 1993.
A. Kumar. Hierarchical Quorum Consensus — A New Algorithm for Managing Replicated Data. IEEE Trans. on Computers, 39(9):996–1004, Sep. 1991.
M. Maekawa. A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. on Computer Systems, 3(2):145–159, May 1985.
S. Ranagarajan and S. Tripathi. Robust Distributed Mutual Exclusion Algorithms. In Proc. of 5th Int. Workshop on Distributed Algorithms, pp. 295–308, Oct. 1991. Lecture Notes in Computer Science, 579, Springer-Verlag.
K. Raymond. A distributed algorithm for multiple entries to a critical section. IPL, 30(4):189–193, Feb. 1989.
G. Ricart and A. K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1):9–17, January 1981.
J. Riordan. An Introduction to Combinatorial Analysis. Princeton Univ. Press, 1978.
P. K. Srimani and R. L. N. Reddy. Another distributed algorithm for multiple entries to a critical section. IPL, 41(1):51–57, Jan. 1992.
I. Suzuki and T. Kasami. A Distributed Mutual Exclusion Algorithm. ACM Trans. on Computer Systems, 3(4):344–349, Nov. 1985.
S.-M. Yuan and H.-K. Chang. Comments on “Availability of k-Coterie”. IEEE Trans. on Computers, 43(12):1457, Dec. 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, D., Eğecioğlu, Ö., El Abbadi, A. (1995). Analysis of quorum-based protocols for distributed (k+1)-exclusion. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030830
Download citation
DOI: https://doi.org/10.1007/BFb0030830
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive