The availability of quorum systems
From MaRDI portal
Publication:1908347
DOI10.1006/INCO.1995.1169zbMATH Open0839.68005OpenAlexW2063738427MaRDI QIDQ1908347FDOQ1908347
Publication date: 26 February 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1169
Cited In (27)
- Byzantine quorum systems with maximum availability.
- Quorum systems constructed from combinatorial designs
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Planar quorums
- Increasing the resilience of distributed and replicated database systems
- Billiard quorums on the grid
- Geographic quorum system approximations
- Crumbling walls: a class of practical and efficient quorum systems
- Optimal availability quorum systems: theory and practice
- Local majorities, coalitions and monopolies in graphs: A review
- Title not available (Why is that?)
- Dynamic monopolies of constant size
- Access cost for asynchronous Byzantine quorum systems
- Planar quorums
- A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
- Probabilistic quorum systems
- Signed quorum systems
- Average probe complexity in quorum systems
- On quorum systems for group resources allocation
- Title not available (Why is that?)
- Load balancing in quorum systems
- Randomized registers and iterative algorithms
- How many cooks spoil the soup?
- New heuristics for the multidimensional vote assignment problem
- Refined quorum systems
- Synchronous Byzantine quorum systems
- The availability of crumbling wall quorum systems
Recommendations
This page was built for publication: The availability of quorum systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908347)
