How fast can a distributed atomic read be?
DOI10.1145/1011767.1011802zbMATH Open1321.68071OpenAlexW1966994880MaRDI QIDQ5501503FDOQ5501503
Authors: Partha Sharathi Dutta, Ron Levy, Arindam Chakraborty, Rachid Guerraoui 
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011802
Recommendations
- Fast access to distributed atomic memory
- How fast can a very robust read be?
- scientific article; zbMATH DE number 1931815
- Fast non-blocking atomic commit: an inherent trade-off
- Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
- Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
- scientific article; zbMATH DE number 97098
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (11)
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- How fast can a very robust read be?
- Reconfigurable distributed storage for dynamic networks
- Fragmented objects: boosting concurrency of shared large objects
- Refined quorum systems
- Making ``fast atomic operations computationally tractable
- Tractable low-delay atomic memory
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
- The complexity of robust atomic storage
- Fast access to distributed atomic memory
- Brief announcement: Oh-RAM! One and a half round read/write atomic memory
This page was built for publication: How fast can a distributed atomic read be?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501503)
