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
Constructing two-writer atomic registers
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 control with “readers” and “writers”
Communications of the ACM
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of parallel algorithms
The complexity of parallel algorithms
Atomic shared register access by asynchronous hardware
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Time and space optimal implementations of atomic multi-writer register
Information and Computation
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
An algorithm is given for the multi-writer version of the Concurrent Reading While Writing (CRWW) problem. The algorithm solves the problem of allowing simultaneous access to arbitrarily sized shared data without requiring waiting, and hence avoids mutual exclusion. This. demonstrates that a quite complicated concurrent control problem can be solved-without eliminating the efficiency of parallelism. One very important aspect of the algorithm are the tools developed to prove its correctness. Without these tools, proving the correctness of a solution to a problem of this complexity would be very difficult.