Optimal availability quorum systems: theory and practice

DOI10.1016/S0020-0190(98)00017-9MaRDI QIDQ293249zbMATH OpenFDO

Authors Yair Amir, Avishai Wool

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098000179?np=y

zbMATH Keywords

distributed computingreplicationfault tolerancequorum systems

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• The availability of quorum systems
• The Load, Capacity, and Availability of Quorum Systems
• scientific article; zbMATH DE number 1559572
• Byzantine quorum systems
• Probabilistic quorum systems

Cites work

• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
• Crumbling walls: a class of practical and efficient quorum systems
• Distributed match-making
• How to assign votes in a distributed system
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Optimal coteries and voting schemes
• The Load, Capacity, and Availability of Quorum Systems
• The availability of quorum systems

Cited in

(12)

• Quorum systems constructed from combinatorial designs
• Signed quorum systems
• Distributed Computing
• Optimal Termination Protocols for Network Partitioning
• Planar quorums
• Refined quorum systems
• Crumbling walls: a class of practical and efficient quorum systems
• Probabilistic quorum systems
• Signed quorum systems
• Principles of Distributed Systems
• Distributed Computing
• The availability of quorum systems

This page was built for publication: Optimal availability quorum systems: theory and practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293249)