The time complexity of updating snapshot memories
From MaRDI portal
(Redirected from Publication:293175)
Recommendations
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
- Composite registers
- Linear-time snapshot implementations in unbalanced systems
- On interprocess communication. I: Basic formalism
- On interprocess communication. II: Algorithms
- Optimal multi-writer multi-reader atomic register
- The time complexity of updating snapshot memories
- Time-Lapse Snapshots
Cited in
(9)- Linear-time snapshot implementations in unbalanced systems
- Time-space tradeoffs for implementations of snapshots
- Hundreds of impossibility results for distributed computing
- A CONSTANT TIME ALGORITHM FOR DNA ADD
- The complexity of updating snapshot objects
- Intermediate value linearizability: a quantitative correctness criterion
- The time complexity of updating snapshot memories
- Inherent limitations on disjoint-access parallel implementations of transactional memory
- The F-Snapshot Problem
This page was built for publication: The time complexity of updating snapshot memories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293175)