Analysis of quorum-based protocols for distributed (k + 1)-exclusion

Divyakant Agrawal, Ömer Eǧecioǧlu, Amr El Abbadi

Research output: Contribution to journalArticle

12 Citations (Scopus)


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. 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.

Original languageEnglish
Pages (from-to)533-537
Number of pages5
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number5
Publication statusPublished - 1 Dec 1997



  • Distributed systems
  • Fault-tolerance
  • Mutual exclusion
  • Replicated data

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this