Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS

DOI10.1145/1281100.1281108zbMath1283.68242OpenAlexW2068109643MaRDI QIDQ5401390

Nikolaos D. Kallimanis, Panagiota Fatourou

Publication date: 13 March 2014

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

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

zbMATH Keywords

snapshotsdistributed algorithmsasynchronoussingle-scannerwait-free implementationscompare-and-swap (CAS)linearizable objects

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (2)

The complexity of updating snapshot objects ⋮ Iterative computations with ordered read-write locks

This page was built for publication: Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS