The Load, Capacity, and Availability of Quorum Systems

DOI10.1137/S0097539795281232MaRDI QIDQ4388880zbMATH OpenFDO

Authors Moni Naor, Avishai Wool

Publication date 10 May 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539795281232

zbMATH Keywords

distributed computingfault tolerancelinear programmingloadpercolation theoryquorum systems

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Reliability and life testing (62N05) Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Distributed algorithms (68W15) Linear programming (90C05) Voting theory (91B12)

Recommendations

• The availability of quorum systems
• Optimal availability quorum systems: theory and practice
• scientific article; zbMATH DE number 1559572
• Quorum systems constructed from combinatorial designs
• Byzantine quorum systems

Cited in

(37)

• A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
• Planar quorums
• Geographic quorum system approximations
• Quorum systems constructed from combinatorial designs
• Probabilistic quorum systems
• The availability of quorum systems
• Randomized registers and iterative algorithms
• Probabilistic quorums for dynamic systems
• Signed quorum systems
• On quorum systems for group resources allocation
• Relative blocking in posets
• Billiard quorums on the grid
• Optimal availability quorum systems: theory and practice
• Quorums from difference covers
• Load Balancing in Quorum Systems
• The Load and Availability of Byzantine Quorum Systems
• scientific article; zbMATH DE number 1559572 (Why is no real title available?)
• How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
• Load balancing in quorum systems
• Crumbling walls: a class of practical and efficient quorum systems
• Byzantine quorum systems
• Secure reliable multicast protocols in a WAN
• Synchronous Byzantine quorum systems
• Access cost for asynchronous Byzantine quorum systems
• Quorum placement in networks to minimize access delays
• Quorum placement in networks, minimizing network congestion
• Distributed Computing
• Signed quorum systems
• Probabilistic quorums for dynamic systems. (Extended abstract)
• Scalable and dynamic quorum systems
• Average probe complexity in quorum systems
• Planar quorums
• Asymmetric distributed trust
• \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
• The availability of crumbling wall quorum systems
• Swiper: a new paradigm for efficient weighted distributed protocols
• Refined quorum systems

This page was built for publication: The Load, Capacity, and Availability of Quorum Systems

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