Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)

DOI10.1145/343477.343521zbMath1314.68052OpenAlexW1967980352MaRDI QIDQ5176772

Dan Touitou, Gideon Stupp, Yehuda Afek

Publication date: 3 March 2015

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

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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (6)

Efficient adaptive collect using randomization ⋮ An adaptive collect algorithm with applications ⋮ Adaptive and efficient mutual exclusion ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Anti-\(\Omega \): the weakest failure detector for set agreement ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention

This page was built for publication: Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)