Faster than optimal snapshots (for a while)

DOI10.1145/2332432.2332507zbMath1301.68086OpenAlexW2151672566MaRDI 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 objectsatomic snapshotrestricted-use objectsgeneralized counters

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items (2)

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

This page was built for publication: Faster than optimal snapshots (for a while)