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

DOI10.1007/978-3-540-87779-0_20MaRDI QIDQ3540237zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Fast access to distributed atomic memory
• How fast can a distributed atomic read be?
• Computationally light ``multi-speed atomic memory
• Tractable low-delay atomic memory
• scientific article; zbMATH DE number 2013830

Cites work

• Byzantine quorum systems
• Crumbling walls
• Efficient replication of large data objects
• How fast can a distributed atomic read be?
• How fast can a very robust read be?
• How to assign votes in a distributed system
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• scientific article; zbMATH DE number 2013830 (Why is no real title available?)
• Long-lived RAMBO: trading knowledge for communication
• Multi-writer consistency conditions for shared memory objects
• On interprocess communication. I: Basic formalism
• On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
• Refined quorum systems
• Sharing memory robustly in message-passing systems

Cited in

(8)

• Real-time atomic multicast algorithms implemented on a shared memory multiprocessor
• GeoQuorums: implementing atomic memory in mobile ad hoc networks
• 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
• How fast can a distributed atomic read be?

Describes a project that uses

Uses Software

• ns-2

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)