The availability of quorum systems
From MaRDI portal
Publication:1908347
DOI10.1006/inco.1995.1169zbMath0839.68005OpenAlexW2063738427MaRDI QIDQ1908347
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
Related Items (20)
Billiard quorums on the grid ⋮ Optimal availability quorum systems: theory and practice ⋮ Signed quorum systems ⋮ On quorum systems for group resources allocation ⋮ Load balancing in quorum systems ⋮ Randomized registers and iterative algorithms ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ Synchronous Byzantine quorum systems ⋮ Access cost for asynchronous Byzantine quorum systems ⋮ \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks ⋮ The availability of crumbling wall quorum systems ⋮ Average probe complexity in quorum systems ⋮ Increasing the resilience of distributed and replicated database systems ⋮ How many cooks spoil the soup? ⋮ Planar quorums ⋮ Dynamic monopolies of constant size ⋮ Byzantine quorum systems with maximum availability. ⋮ Quorum systems constructed from combinatorial designs ⋮ Probabilistic quorum systems ⋮ Local majorities, coalitions and monopolies in graphs: A review
This page was built for publication: The availability of quorum systems
