Nothing Special   »   [go: up one dir, main page]

Skip to main content

Quorum Systems

With Applications to Storage and Consensus

  • Book
  • © 2012

Overview

Part of the book series: Synthesis Lectures on Distributed Computing Theory (SLDCT)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 15.99 USD 29.99
Discount applied Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 15.99 USD 37.99
Discount applied Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

A quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Quorum systems are the key mathematical abstraction for ensuring consistency in fault-tolerant and highly available distributed computing. Critical for many applications since the early days of distributed computing, quorum systems have evolved from simple majorities of a set of processes to complex hierarchical collections of sets, tailored for general adversarial structures. The initial non-empty intersection property has been refined many times to account for, e.g., stronger (Byzantine) adversarial model, latency considerations or better availability. This monograph is an overview of the evolution and refinement of quorum systems, with emphasis on their role in two fundamental applications: distributed read/write storage and consensus. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems

Similar content being viewed by others

Table of contents (7 chapters)

Authors and Affiliations

  • Eurécom, France

    Marko Vukolić

About the author

Marko Vukoli´c is an assistant professor in the Networking and Security Department at Eurécom, France. He received his engineering degree in Communication Systems from University of Belgrade, Serbia in 2001 and his doctor of science degree in Distributed Systems from EPFL, Switzerland in 2008. He was affiliated with IBM Research – Zurich where he spent time in the Storage Systems group as a post-doc from 2008–2010.

Bibliographic Information

Publish with us