IEEE Trans. on Parallel and Distributed Systems,
Vol 8, No, 5, (1997), pp. 533--537
Divyakant Agrawal, Ömer Egecioglu, and Amr El Abbadi
Analysis of quorum-based protocols for distributed (k+1)-exclusion
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.
omer@cs.ucsb.edu