Linear-time snapshot implementations in unbalanced systems

DOI10.1007/BF01185868MaRDI QIDQ4850334zbMATHFDO

Authors 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)

Recommendations

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

Cites work

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

Cited in

(6)

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

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)