The elusive atomic register

DOI10.1145/174652.174657zbMath0806.68025OpenAlexW2036667872MaRDI QIDQ4299010

James H. Anderson, Ambuj K. 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

zbMATH Keywords

wait-free synchronization\(N\)-bit atomic registermultiple-reader atomic register

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of operating systems (68N25) Distributed algorithms (68W15)

Related Items (10)

Composite registers ⋮ Efficient algorithms for checking the atomicity of a run of read and write operations ⋮ Wait-free computing ⋮ Nonatomic mutual exclusion with local spinning ⋮ Randomized two-process wait-free test-and-set ⋮ On interprocess communication and the implementation of multi-writer atomic registers ⋮ A criterion for atomicity ⋮ Finite-state concurrent programs can be expressed succinctly in triple normal form ⋮ Towards a practical snapshot algorithm ⋮ Finite-state concurrent programs can be expressed in pairwise normal form

This page was built for publication: The elusive atomic register