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
IEEE Transactions on Computers
On achieving consensus using a shared memory
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)
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
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)
Buffer-optimal constructions of 1-writer multireader multivalued atomic shared variables
Journal of Parallel and Distributed Computing
How to share concurrent wait-free variables
Journal of the ACM (JACM)
Bounded Concurrent Time-Stamping
SIAM Journal on Computing
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
SIAM Journal on Computing
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
Distributed Algorithms
Proceedings of the 2nd 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
Distributed Computing
Multi-writer composite registers
Distributed Computing
Atomic shared register access by asynchronous hardware
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Concurrent reading while writing II: The multi-writer case
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a surprisingly simple and natural scheme to obtain several waitfree constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove correct than any previous construction. Our main construction is the first symmetric pure timestamp one that is optimal with respect to the worst-case local use of control bits; the other one is optimal with respect to global use of control bits; both are optimal in time.