Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data

Research output: Contribution to journalArticlepeer-review

154 Scopus citations

Abstract

This paper describes a new algorithm for managing replicated data. The standard quorum consensus method is an expensive means of maintaining consistency across multiple copies of an object if the number of copies is large because it typically requires at least a majority of the copies to form a quorum for a write operation. Our method is based on organizing the copies of an object into a logical, multilevel hierarchy, and extending the quorum consensus algorithm to such an environment. Several properties of the method are derived and optimality conditions are given for minimizing the quorum size. It is shown that, given a collection of n copies of an object, our method allows a quorum to be formed with n0.63copies versus [formula Omitted] copies in the case of the majority voting algorithm. Tradeoffs between ours and three other quorum-based methods are discussed, and the main features of each method are highlighted.

Original languageEnglish (US)
Pages (from-to)996-1004
Number of pages9
JournalIEEE Transactions on Computers
Volume40
Issue number9
DOIs
StatePublished - Sep 1991

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data'. Together they form a unique fingerprint.

Cite this