Single-scanner multi-writer snapshot implementations are fast!

DOI10.1145/1146381.1146416zbMath1314.68373OpenAlexW2034515443MaRDI QIDQ5177284

Nikolaos D. Kallimanis, Panagiota Fatourou

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.1146416

zbMATH Keywords

snapshotasynchronouswait-freeatomic objectsshared memory systemsmulti-writersingle-scanner

Mathematics Subject Classification ID

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

Related Items (1)

The complexity of updating snapshot objects

This page was built for publication: Single-scanner multi-writer snapshot implementations are fast!