Optimal Multi-Writer Multi-Reader Atomic Register (1992)
| Venue: | In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing |
| Citations: | 19 - 0 self |
BibTeX
@INPROCEEDINGS{Israeli92optimalmulti-writer,
author = {A. Israeli and A. Shaham and Amos Israeli and Amnon Shaham},
title = {Optimal Multi-Writer Multi-Reader Atomic Register},
booktitle = {In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing},
year = {1992},
pages = {71--82},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper addresses the wide gap in space complexity of atomic, multi-writer, multireader register implementations. While the space complexity of all previous implementations is linear, the lower bounds are logarithmic. We present two implementations which close this gap: The first implementation uses multi-reader physical registers while the second uses single-reader physical registers. Both implementations are optimal with respect to the two most important complexity criteria: Their space complexity is logarithmic and their time complexity is linear. 1991 Mathematics Subject Classification: 68M10, 68Q22, 68Q25. CR Categories: B.3.2, B.4.3, D.4.1, D.4.4. Keywords and Phrases: Shared Register, Concurrent Reading and Writind, Atomicity, Multiwriter Register. Note: This work is partially supported by NWO through NFI Project ALADDIN under Contract number NF 62-376. A preliminary version of this paper was presented in the 11th Annual ACM Symposium on Principles of Distributed Computing, August 1992, Vancouver, Canada. 1
