Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Constructing 1-writer multireader multivalued atomic variables from regular variables
Journal of the ACM (JACM)
On interprocess communication and the implementation of multi-writer atomic registers
Theoretical Computer Science
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)
Efficient and robust sharing of memory in message-passing systems
Journal of Algorithms
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
Distributed Computing
Hi-index | 0.00 |
Developing fault-tolerant programs for distributed systems is a difficult task. It seems that it is more difficult to develop fault-tolerant programs for message passing systems than for shared memory systems. Consequently, there has been a lot of interest in simulating atomic shared memory by constructing atomic shared variables in message passing systems. The best known construction of 1-writer n-reader atomic variables is of Attiya (J. Algorithms 34 (2000) 109). She first constructs 1-writer n-reader regular variables, and then uses them to construct atomic variables. Her regular variable construction requires, for each operation execution, exchanging 2n messages of size @?(n^3) bits. A new construction of 1-writer n-reader regular variables is proposed. Each operation execution requires exchanging 2n messages of size @?(n^2logn) bits.