Atomic shared register access by asynchronous hardware
Paul M. B. Vitanyi, Baruch Awerbuch · Annual Symposium on Foundations of Computer Science · 1986
The contribution of this paper is two-fold. First, we describe two ways to construct multivalued atomic n-writer n-reader registers. The first solution uses atomic 1-writer 1-reader registers and unbounded tags. the other solution uses atomic 1-writer n-reader registers and bounded tags. The second part of the paper develops a general methodology to prove atomicity, by identifying a set of criteria which guaranty an effective construction for the required atomic mapping. We apply the method to prove atomicity of the two implementations for atomic multiwriter multireader registers.
Cited by 174 works. doi:10.1109/sfcs.1986.11
Authors
References
- On interprocess communication
- Concurrent reading and writing
- Concurrent Reading While Writing
- The mutual exclusion problem
- Axioms for memory access in asynchronous hardware systems
- Constructing two-writer atomic registers
- Distributed FIFO allocation of identical resources using small shared space
- Distributed FIFO Allocation of Identical Resources Using Small Shared Space.