Towards a practical snapshot algorithm

DOI10.1016/S0304-3975(00)00412-6MaRDI QIDQ5958615zbMATH OpenFDO

Authors Yaron Riany, Nir Shavit, Dan Touitou

Publication date 3 March 2002

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

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00412-6

zbMATH Keywords

atomic operationscompare and swapmemory snapshotsshared memory multiprocessorswait-free synchronization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Atomic snapshots of shared memory
• Faster than optimal snapshots (for a while), preliminary version
• Atomic Snapshots in O (n log n) Operations
• Time-Lapse Snapshots
• Atomic snapshots using lattice agreement

Cites work

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

Cited in

(12)

• Lower and upper bounds for single-scanner snapshot implementations
• The F-Snapshot Problem
• Time-space tradeoffs for implementations of snapshots
• Dynamic atomic snapshots
• A tight time lower bound for space-optimal implementations of multi-writer snapshots
• Atomic snapshots of shared memory
• Atomic Snapshots in O (n log n) Operations
• Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method
• Atomic snapshots using lattice agreement
• Wait-free concurrent memory management by create and read until deletion (CaRuD)
• Limited-use atomic snapshots with polylogarithmic step complexity
• The complexity of updating snapshot objects

Describes a project that uses

Uses Software

• PROTEUS

This page was built for publication: Towards a practical snapshot algorithm

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