Towards a practical snapshot algorithm

DOI10.1016/S0304-3975(00)00412-6zbMath0983.68240MaRDI QIDQ5958615

Nir Shavit, Yaron Riany, Dan Touitou

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

atomic operationscompare and swapmemory snapshotsshared memory multiprocessorswait-free synchronization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

Lower and upper bounds for single-scanner snapshot implementations ⋮ Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method ⋮ The complexity of updating snapshot objects ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity

Uses Software

• PROTEUS

Cites Work

• Unnamed Item
• On interprocess communication. II: Algorithms
• Bounded time-stamps
• Elimination trees and the construction of pools and stacks
• The Instancy of Snapshots and Commuting Objects
• Time-Lapse Snapshots
• Atomic snapshots of shared memory
• The elusive atomic register
• Are wait-free algorithms fast?
• Counting networks
• Bounded Concurrent Time-Stamping
• Atomic Snapshots in O (n log n) Operations
• Atomic snapshots using lattice agreement
• Generalized FLP impossibility result for t-resilient asynchronous computations
• The asynchronous computability theorem for t-resilient tasks
• Optimal space distributed move-to-front lists
• Practical implementations of non-blocking synchronization primitives
• Immediate atomic snapshots and fast renaming