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

DOI10.1016/0020-0190(95)00198-0zbMath0875.68407OpenAlexW2037420952MaRDI QIDQ1351169

Philippas Tsigas, Paul G. Spirakis, Lefteris M. Kirousis

Publication date: 27 February 1997

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

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)

Related Items (2)

Linear-time snapshot implementations in unbalanced systems ⋮ Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method

Cites Work

• On interprocess communication. I: Basic formalism
• Atomic snapshots in O(n log n) operations
• Unnamed Item

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