Simple atomic snapshots: A linear complexity solution with unbounded time-stamps

DOI10.1016/0020-0190(95)00198-0MaRDI QIDQ1351169zbMATH OpenOpenAlexFDO

Authors L. M. Kirousis, P. G. Spirakis, Philippas Tsigas

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/0020-0190(95)00198-0

zbMATH Keywords

Distributed computingSnapshot problemWait-free registers

Mathematics Subject Classification ID

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

Recommendations

• Composite registers
• Bounded Concurrent Time-Stamping
• Atomic snapshots of shared memory
• Efficient algorithms for checking the atomicity of a run of read and write operations
• The elusive atomic register

Cites work

• Atomic snapshots in O(n log n) operations
• scientific article; zbMATH DE number 1346488 (Why is no real title available?)
• On interprocess communication. I: Basic formalism

Cited in

(6)

• Efficient algorithms for checking the atomicity of a run of read and write operations
• Composite registers
• Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method
• Linear-time snapshot implementations in unbalanced systems
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
• Self-stabilizing snapshot objects for asynchronous failure-prone networked systems

This page was built for publication: Simple atomic snapshots: A linear complexity solution with unbounded time-stamps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351169)