Performance analysis of a hierarchical quorum consensus algorithm for replicated objects

Research output: Contribution to conferencePaper

24 Scopus citations

Abstract

A class of algorithms for synchronizing a large number of identical copies of an object is described, and its performance is evaluated. The method is based on organizing a group of objects into a multilevel hierarchy and extending the quorum consensus algorithm to such an environment. The performance of the algorithm is compared, in terms of availability and message cost, with that of two other methods, majority voting and dynamic voting using a simulation model. Although the author's method uniformly outperforms the other two methods in terms of average message cost, no single method is found to dominate in terms of availability. The conditions under which each method performs well are identified.

Original languageEnglish (US)
Pages378-385
Number of pages8
StatePublished - Dec 1 1990
EventProceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10 - Paris, Fr
Duration: May 28 1990Jun 1 1990

Other

OtherProceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10
CityParis, Fr
Period5/28/906/1/90

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Kumar, A. (1990). Performance analysis of a hierarchical quorum consensus algorithm for replicated objects. 378-385. Paper presented at Proceedings of the 10th International Conference on Distributed Computing Systems - ICDCS-10, Paris, Fr, .