Probabilistic quorum systems

Dahlia Malkhi, Michael Reiter, Rebecca Wright

Research output: Contribution to conferencePaperpeer-review

46 Scopus citations

Abstract

Services replicated using a quorum system allow operations to be performed at only a subset (quorum) of the servers, and ensure consistency among operations by requiring that any two quorums intersect. In this paper we explore the consequences of requiring this intersection property to hold only with very high probability. We show that doing so can offer dramatic improvements in the performance and availability of the service, both for services tolerant of benign server failures and services tolerant of arbitrary (Byzantine) ones. We also prove a lower bound on the performance that can be achieved with this technique.

Original languageEnglish (US)
Pages267-273
Number of pages7
DOIs
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA
Duration: Aug 21 1997Aug 24 1997

Other

OtherProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing
CitySanta Barbara, CA, USA
Period8/21/978/24/97

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Probabilistic quorum systems'. Together they form a unique fingerprint.

Cite this