Linear-time snapshot implementations in unbalanced systems

DOI10.1007/BF01185868zbMATH Open0833.68047MaRDI QIDQ4850334FDOQ4850334

Authors: Amos Israeli, Amnon Shaham, Asaf Shirazi 

Publication date: 9 October 1995

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

Recommendations

• The time complexity of updating snapshot memories
• Efficient synchronous snapshots
• Time-Lapse Snapshots
• Time-space tradeoffs for implementations of snapshots

zbMATH Keywords

shared memory systemsatomic snapshot memory

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Time-optimal, space-efficient single-scanner snapshots \& multi-scanner snapshots using CAS
• Time-space tradeoffs for implementations of snapshots
• The time complexity of updating snapshot memories
• The F-Snapshot Problem
• Lower and upper bounds for single-scanner snapshot implementations
• The complexity of updating snapshot objects

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

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