The time complexity of updating snapshot memories
From MaRDI portal
Publication:293175
DOI10.1016/S0020-0190(97)00189-0zbMATH Open1339.68022OpenAlexW2065344737MaRDI QIDQ293175FDOQ293175
Authors: Amos Israeli, Asaf Shirazi 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097001890?np=y
Recommendations
Analysis of algorithms and problem complexity (68Q25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- On interprocess communication. I: Basic formalism
- On interprocess communication. II: Algorithms
- Composite registers
- The time complexity of updating snapshot memories
- Time-Lapse Snapshots
- Atomic snapshots of shared memory
- Are wait-free algorithms fast?
- Linear-time snapshot implementations in unbalanced systems
- Atomic snapshots using lattice agreement
- Optimal multi-writer multi-reader atomic register
- Atomic snapshots in O(n log n) operations
Cited In (9)
- A CONSTANT TIME ALGORITHM FOR DNA ADD
- Linear-time snapshot implementations in unbalanced systems
- Hundreds of impossibility results for distributed computing
- Time-space tradeoffs for implementations of snapshots
- The time complexity of updating snapshot memories
- The F-Snapshot Problem
- Intermediate value linearizability: a quantitative correctness criterion
- The complexity of updating snapshot objects
- Inherent limitations on disjoint-access parallel implementations of transactional memory
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)
