The elusive atomic register
From MaRDI portal
Publication:4299010
DOI10.1145/174652.174657zbMATH Open0806.68025OpenAlexW2036667872MaRDI QIDQ4299010FDOQ4299010
Authors: James H. Anderson, Ambuj Singh, Mohamed G. Gouda 
Publication date: 29 June 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/174652.174657
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Theory of operating systems (68N25)
Cited In (21)
- One-write algorithms for multivalued regular and atomic registers
- Wait-free computing
- Nonatomic mutual exclusion with local spinning
- Title not available (Why is that?)
- Simple extensions of 1-writer atomic variable constructions to multiwriter ones
- Efficient algorithms for checking the atomicity of a run of read and write operations
- Optimal multi-writer multi-reader atomic register
- Title not available (Why is that?)
- Time and space optimal implementations of atomic multi-writer register
- Algorithms – ESA 2004
- Towards a practical snapshot algorithm
- Constructing two-writer atomic registers
- Converting Lamport's regular register to atomic register
- Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
- A criterion for atomicity
- Step-optimal implementations of large single-writer registers
- Composite registers
- Finite-state concurrent programs can be expressed in pairwise normal form
- Randomized two-process wait-free test-and-set
- On interprocess communication and the implementation of multi-writer atomic registers
- Finite-state concurrent programs can be expressed succinctly in triple normal form
This page was built for publication: The elusive atomic register
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4299010)
