Quorum Systems

With Applications to Storage and Consensus

Marko Vukolic (Autor)

Buch | Softcover

XV, 130 Seiten

2012
Springer International Publishing (Verlag)
978-3-031-00879-5 (ISBN)

Artikel merken

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

Marko Vukolic is an assistant professor in the Networking and Security Department at Eurecom, 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.

Introduction.- Preliminaries.- Classical Quorum Systems.- Classical Quorum-Based Emulations.- Byzantine Quorum Systems.- Latency-efficient Quorum Systems.- Probabilistic Quorum Systems.

Erscheinungsdatum	06.06.2022
Reihe/Serie	Synthesis Lectures on Distributed Computing Theory
Zusatzinfo	XV, 130 p.
Verlagsort	Cham
Sprache	englisch
Maße	191 x 235 mm
Gewicht	293 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Informatik ► Theorie / Studium ► Kryptologie
ISBN-10	3-031-00879-0 / 3031008790
ISBN-13	978-3-031-00879-5 / 9783031008795
Zustand	Neuware