How to share concurrent wait-free variables
Journal of the ACM (JACM)
How to share concurrent wait-free variables
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
Information and Computation
Self-stabilization of wait-free shared memory objects
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Distributed Computing
Brief announcement: a shared disk on distributed storage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized wait-free consensus using an atomicity assumption
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Two implementations of a multi-writer, multi-reader, atomic register are presented. The physical registers used by the first implementation are single-writer, multi-reader, atomic registers; the physical registers used by the second implementation are single-reader, single-writer, atomic registers. Both implementations are optimal with respect to the two most important complexity criteria: In both implementation the space complexity is logarithmic, thus matching the lower bound proven by Cori and Sopena; and the time complexity is linear, thus matching the obvious lower bound. These implementations improve upon the space complexity of all previous implementations in their respective classes, by an exponential factor.