The elusive atomic register revisited
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing multi-reader atomic values from non-atomic values
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A protocol for wait-free, atomic, multi-reader shared variables
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent reading and writing
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
Efficient parallel algorithms can be made robust
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
On reasoning with the global time assumption
ACM Letters on Programming Languages and Systems (LOPLAS)
Journal of the ACM (JACM)
How to share concurrent wait-free variables
Journal of the ACM (JACM)
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Distributed Computing
Multi-writer composite registers
Distributed Computing
Efficient parallel algorithms can be made robust
Distributed Computing
A challenge for atomicity verification
Science of Computer Programming
Simpler backward simulation proofs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
| Hi-index | 14.98 |
A two-writer, n-reader atomic memory register is constructed from two one-writer, (n+1)-reader atomic memory registers. There are no restrictions on the size of the constructed register. The simulation requires only a single extra bit per real register and can survive the failure of any set of readers and writers. A complete proof of correctness is given. Several obvious ways are suggested to try to extend this algorithm to more than two writers, none of which work. As an example, it is shown how a natural extension of the two-writer protocol fails.