On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
DOI10.1007/978-3-540-87779-0_20zbMATH Open1161.68337OpenAlexW1557451217MaRDI QIDQ3540237FDOQ3540237
Authors: Chryssis Georgiou, Nicolas Nicolaou, Alexander A. Schwarzmann 
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_20
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- On interprocess communication. I: Basic formalism
- Title not available (Why is that?)
- Byzantine quorum systems
- How to assign votes in a distributed system
- Title not available (Why is that?)
- Sharing memory robustly in message-passing systems
- Multi-writer consistency conditions for shared memory objects
- Efficient replication of large data objects
- Long-lived RAMBO: trading knowledge for communication
- Refined quorum systems
- Crumbling walls
- How fast can a distributed atomic read be?
- How fast can a very robust read be?
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
Cited In (8)
- Real-time atomic multicast algorithms implemented on a shared memory multiprocessor
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- How fast can a distributed atomic read be?
- Practically stabilizing SWMR atomic memory in message-passing systems
- Tractable low-delay atomic memory
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
- Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems
- Fast access to distributed atomic memory
Uses Software
This page was built for publication: On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540237)
