Limited-use atomic snapshots with polylogarithmic step complexity
DOI10.1145/2732263zbMATH Open1321.68270OpenAlexW2034956448MaRDI QIDQ5501949FDOQ5501949
Authors: James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen 
Publication date: 14 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2732263
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Composite registers
- Atomic snapshots of shared memory
- Are wait-free algorithms fast?
- Time and Space Lower Bounds for Nonblocking Implementations
- Immediate atomic snapshots and fast renaming
- Atomic Snapshots in O (n log n) Operations
- F-arrays, implementation and applications
- SOFSEM 2005: Theory and Practice of Computer Science
- Towards a practical snapshot algorithm
- Adaptive and efficient algorithms for lattice agreement and renaming
- An optimal multi-writer snapshot algorithm
- Polylogarithmic concurrent data structures from monotone circuits
- Approximate shared-memory counting despite a strong adversary
- Lower bounds for restricted-use objects
Cited In (5)
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
- Atomic snapshots from small registers
- Faster than optimal snapshots (for a while), preliminary version
- Erratum to: ``Limited-use atomic snapshots with polylogarithmic step complexity
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
This page was built for publication: Limited-use atomic snapshots with polylogarithmic step complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501949)
