How fast can a distributed atomic read be?

DOI10.1145/1011767.1011802zbMath1321.68071OpenAlexW1966994880MaRDI QIDQ5501503

Ron Levy, Partha Sharathi Dutta, 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

zbMATH Keywords

atomic registerstime-complexityshared-memory emulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (5)

Reconfigurable distributed storage for dynamic networks ⋮ Time-efficient read/write register in crash-prone asynchronous message-passing systems ⋮ On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory ⋮ Refined quorum systems ⋮ Fragmented objects: boosting concurrency of shared large objects

This page was built for publication: How fast can a distributed atomic read be?