Axioms for memory access in asynchronous hardware systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
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
Converting Lamport's regular register to atomic register
Information Processing Letters
Constructing Two-Writer Atomic Registers
IEEE Transactions on Computers
Parallel program design: a foundation
Parallel program design: a foundation
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent control with “readers” and “writers”
Communications of the ACM
Proceedings of the 2nd International Workshop on Distributed Algorithms
How to Construct an Atomic Variable (Extended Abstract)
Proceedings of the 3rd International Workshop on Distributed Algorithms
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
The Virtue of Patience: Concurrent Programming with and Without Waiting
The Virtue of Patience: Concurrent Programming with and Without Waiting
The Elusive Atomic Register
Constructing 1-writer multireader multivalued atomic variables from regular variables
Journal of the ACM (JACM)
Computing with faulty shared objects
Journal of the ACM (JACM)
How to share concurrent wait-free variables
Journal of the ACM (JACM)
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
Synthesis of concurrent programs for an atomic read/write model of computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Nonatomic mutual exclusion with local spinning
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Randomized two-process wait-free test-and-set
Distributed Computing
On the use of registers in achieving wait-free consensus
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.01 |
We present a construction of a single-writer, multiple-reader atomic register from single-writer, single-reader atomic registers. The complexity of our construction is asymptotically optimal; O(M2 + MN) shared single-writer, single-reader safe bits are required to construct a single-writer, M-reader, N-bit atomic register.