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
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Counterexamples to a one writer multireader atomic variable construction of Burns and Peterson
ACM SIGOPS Operating Systems Review
Optimal multi-writer multi-reader atomic register
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Optimality of wait-free atomic multiwriter variables
Information Processing Letters
ISTCS'92 Symposium proceedings on Theory of computing and systems
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
Journal of the ACM (JACM)
Constructing 1-writer multireader multivalued atomic variables from regular variables
Journal of the ACM (JACM)
Forward and backward simulations I.: untimed systems
Information and Computation
Bounded Concurrent Time-Stamping
SIAM Journal on Computing
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
WDAG '92 Proceedings of the 6th 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
A Proof Technique for Register Automicity
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Distributed Computing
Optimal multi-writer multi-reader atomic register
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On beyond registers: wait-free readable objects
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
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Randomized two-process wait-free test-and-set
Distributed Computing
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Theoretical Computer Science
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
Constructing regular variables in message passing systems
Journal of Parallel and Distributed Computing
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Multiword atomic read/write registers on multiprocessor systems
Journal of Experimental Algorithmics (JEA)
Journal of Parallel and Distributed Computing
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The space complexity of long-lived and one-shot timestamp implementations
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
The space complexity of unbounded timestamps
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
Journal of the ACM (JACM)
| Hi-index | 0.01 |
Sharing data between multiple asynchronous users—each of which can atomically read and write the data—is a feature that may help to increase the amount of parallelism in distributed systems. An algorithm implementing this feature is presented. The main construction of an n-user atomic variable directly from single-writer, single-reader atomic variables uses O(n) control bits and O(n) accesses per Read/Write running in O(1) parallel time.