Scalable and dynamic quorum systems
From MaRDI portal
Publication:5917934
DOI10.1007/S00446-004-0114-3zbMath1264.68032OpenAlexW2015478444MaRDI QIDQ5917934
Publication date: 7 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-004-0114-3
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (3)
\textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems ⋮ Probabilistic quorums for dynamic systems ⋮ \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Billiard quorums on the grid
- On a sharp transition from area law to perimeter law in a system of random surfaces
- Domination by product measures
- Planar quorums
- Novel architectures for P2P applications
- A stochastic process on the hypercube with applications to peer-to-peer networks
- How to assign votes in a distributed system
- The Load, Capacity, and Availability of Quorum Systems
- How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
- Viceroy
- Dynamic voting for consistent primary components
- Fault-Tolerant Storage in a Dynamic Environment
- Distributed Computing
- Average probe complexity in quorum systems
This page was built for publication: Scalable and dynamic quorum systems
