A protocol for wait-free, atomic, multi-reader shared variables
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A computational logic handbook
A computational logic handbook
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
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)
Space-efficient construction of buffer-optimal 1-writer 1-reader multivalued atomic variable
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Invariants for the construction of a handshake register
Information Processing Letters
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
Minimal Shared Information for Concurrent Reading and Writing
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
The Formal Classification and Verification of Simpson's 4-Slot Asynchronous Communication Mechanism
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
An assertional proof for a construction of an atomic variable
Formal Aspects of Computing
A challenge for atomicity verification
Science of Computer Programming
| Hi-index | 0.00 |
A shared variable construction is called buffer-based if the values of the variable are stored in buffers that are different from control storage. Each buffer stores only a single value from the domain of the variable. A buffer-based construction is conflict-free if, in each execution of the shared variable, no reading of any buffer overlaps with any writing of that buffer. This paper studies shared space requirements for wait-free, conflict-free, deterministic constructions of 1-writer 1-reader multivalued atomic variables from safe variables. That four buffers are necessary and sufficient for such constructions has been established in the literature. This paper establishes the requirement for control storage. The least shared space for such a construction in the literature is (four safe buffers and) four safe control bits. We show that four safe control bits are necessary for such constructions when the reader is restricted to read at most one buffer in each read operation.