Analysis of quorum-based protocols for distributed (k+1)-exclusion
- 130 Downloads
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.
KeywordsCommunication Cost Communication Overhead Critical Section Mutual Exclusion Site Failure
Unable to display preview. Download preview PDF.
- 3.D. Cohen. Basic Techniques of Combinatorial Theory. John Wiley & Sons, 1978.Google Scholar
- 4.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.Google Scholar
- 6.D. K. Gifford. Weighted Voting for Replicated Data. In Proc. of 7th ACM Symp. on Operating Systems Principles, pp. 150–159, Dec. 1979.Google Scholar
- 7.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.Google Scholar
- 11.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.Google Scholar
- 14.J. Riordan. An Introduction to Combinatorial Analysis. Princeton Univ. Press, 1978.Google Scholar