Time-Lapse Snapshots
From MaRDI portal
Recommendations
Cited in
(27)- On distributed snapshots
- Bounded time-stamps
- Interval consistency of asynchronous distributed computations
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Consistency as a branching time notion
- The time complexity of updating snapshot memories
- Randomized consensus in expected \(O(n ^{2})\) total work using single-writer registers
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction
- Of concurrent data structures and iterations
- The space complexity of unbounded timestamps
- A Lazy Snapshot Algorithm with Eager Validation
- On the memory overhead of distributed snapshots
- scientific article; zbMATH DE number 1979529 (Why is no real title available?)
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method
- Linear-time snapshot implementations in unbalanced systems
- How a rainbow coloring function can simulate wait-free handshaking
- Atomic snapshots using lattice agreement
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- Randomized protocols for asynchronous consensus
- SNZI, scalable nonzero indicators
- Time-optimal, space-efficient single-scanner snapshots \& multi-scanner snapshots using CAS
- SOFSEM 2005: Theory and Practice of Computer Science
- Towards a practical snapshot algorithm
- Self-stabilizing \(\ell\)-exclusion
- Efficient Bounded Timestamping from Standard Synchronization Primitives
- The complexity of updating snapshot objects
- Efficient bounded timestamping from standard synchronization primitives
This page was built for publication: Time-Lapse Snapshots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268845)
