How fast can a very robust read be?

DOI10.1145/1146381.1146419zbMath1314.68157OpenAlexW2155405969MaRDI QIDQ5177286

Marko Vukolić, Rachid Guerraoui

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146419

zbMATH Keywords

time-complexityarbitrary failuresoptimal resiliencestorage emulations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (2)

On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory ⋮ Refined quorum systems

This page was built for publication: How fast can a very robust read be?