Optimal availability quorum systems: theory and practice
From MaRDI portal
Publication:293249
DOI10.1016/S0020-0190(98)00017-9zbMATH Open1338.68018MaRDI QIDQ293249FDOQ293249
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
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
- The availability of quorum systems
- How to assign votes in a distributed system
- Distributed match-making
- Optimal coteries and voting schemes
- Title not available (Why is that?)
- The Load, Capacity, and Availability of Quorum Systems
- Crumbling walls: a class of practical and efficient quorum systems
Cited In (9)
- Quorum systems constructed from combinatorial designs
- Distributed Computing
- Optimal Termination Protocols for Network Partitioning
- Refined quorum systems
- Crumbling walls: a class of practical and efficient quorum systems
- Probabilistic 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)