Crumbling walls: a class of practical and efficient quorum systems

DOI10.1007/s004460050027zbMath1448.68350OpenAlexW2010506287MaRDI QIDQ5137330

Avishai Wool, David Peleg

Publication date: 2 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460050027

zbMATH Keywords

fault-tolerancedistributed computingavailabilityloadquorum systemscoteries

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Optimal availability quorum systems: theory and practice ⋮ Average probe complexity in quorum systems ⋮ Planar quorums ⋮ Probabilistic quorum systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal availability quorum systems: theory and practice
• The availability of crumbling wall quorum systems
• A guided tour of Chernoff bounds
• Distributed match-making
• A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
• Optimal coteries and voting schemes
• The availability of quorum systems
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
• How to assign votes in a distributed system
• Load Balancing in Quorum Systems
• The Load, Capacity, and Availability of Quorum Systems
• Crumbling walls