On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory

DOI10.1007/978-3-540-87779-0_20zbMath1161.68337OpenAlexW1557451217MaRDI QIDQ3540237

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

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Tractable low-delay atomic memory ⋮ On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory

Uses Software

• ns-2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On interprocess communication. I: Basic formalism
• Long-lived RAMBO: trading knowledge for communication
• On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
• How to assign votes in a distributed system
• Sharing memory robustly in message-passing systems
• How fast can a very robust read be?
• Crumbling walls
• Refined quorum systems
• How fast can a distributed atomic read be?
• Distributed Computing
• Distributed Computing

This page was built for publication: On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory