Abstract
For self-containment, this chapter starts with a short presentation of the notions of safe, regular, and atomic read/write registers (which were introduced in Chap. 2). It then presents simple wait-free implementations of “high-level” registers from “low-level” registers. The notions of “high-level” and “low-level” used here are not related to the computability power but to the abstraction level. This is because, as we will see in the next two chapters, while a regular register is easier to use than a safe register and an atomic register is easier to use than a regular register, they are all computationally equivalent; i.e., any of them can be built wait-free from any other without enriching the underlying system with additional computational power.
The proofs of the theorems stated in this chapter use the definitions and terminology introduced in Chap. 4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Raynal, M. (2013). Safe, Regular, and Atomic Read/Write Registers. In: Concurrent Programming: Algorithms, Principles, and Foundations. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32027-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-32027-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32026-2
Online ISBN: 978-3-642-32027-9
eBook Packages: Computer ScienceComputer Science (R0)