Faster than optimal snapshots (for a while)

DOI10.1145/2332432.2332507zbMath1301.68086MaRDI QIDQ2933814

Faith Ellen, Keren Censor-Hillel, James Aspnes, Hagit Attiya

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

concurrent objects; atomic snapshot; restricted-use objects; generalized counters

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68W15: Distributed algorithms

Related Items

Lower Bounds for Restricted-Use Objects, Tight Bounds for Asynchronous Renaming