Linear-time snapshot implementations in unbalanced systems

DOI10.1007/BF01185868zbMath0833.68047MaRDI QIDQ4850334

Amos Israeli, Amnon Shaham, Asaf Shirazi

Publication date: 9 October 1995

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

shared memory systemsatomic snapshot memory

Mathematics Subject Classification ID

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

Related Items (4)

The time complexity of updating snapshot memories ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ The complexity of updating snapshot objects ⋮ The F-Snapshot Problem

Cites Work

• The time complexity of updating snapshot memories
• On interprocess communication and the implementation of multi-writer atomic registers
• On interprocess communication. I: Basic formalism
• On interprocess communication. II: Algorithms
• Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
• Composite registers
• Time-Lapse Snapshots
• Atomic snapshots of shared memory
• Are wait-free algorithms fast?
• Atomic Snapshots in O (n log n) Operations
• Optimal multi-writer multi-reader atomic register

This page was built for publication: Linear-time snapshot implementations in unbalanced systems