Issue No. 05 - May (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.598279
<p><b>Abstract</b>—A generalization of the majority quorum for the solution of the distributed (<it>k</it> + 1)-exclusion problem is proposed. This scheme produces a family of quorums of varying sizes and availabilities indexed by integral divisors <it>r</it> of <it>k</it>. The cases <it>r</it> = 1 and <it>r</it> = <it>k</it> correspond to known majority based quorum generation algorithms <it>MAJ</it> and <it>DIV</it>, whereas intermediate values of <it>r</it> interpolate between these two extremes. A cost and availability analysis of the proposed methods is also presented. An interesting implication of this analysis is that in a reasonably reliable environment with a large number of sites, even protocols with low communication costs attain high availability.</p>
Mutual exclusion, fault-tolerance, distributed systems, replicated data.
&. Egecioglu, A. El Abbadi and D. Agrawal, "Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 533-537, 1997.