This Article 
 Bibliographic References 
 Add to: 
Constructing Two-Writer Atomic Registers
December 1988 (vol. 37 no. 12)
pp. 1506-1514
A two-writer, n-reader atomic memory register is constructed from two one-writer, (n+1)-reader atomic memory registers. There are no restrictions on the size of the constructed register. The simulation requires only a single extra bit per real register and can survive the failure of any set of readers and writers. A complete proof of correctness is given. Several obvious ways are suggested to t

[1] J. E. Burns and G. L. Peterson, "Constructing multi-reader atomic values from non-atomic values," inProc. PODC '87.
[2] P. J. Courtois, F. Heymans, and D. L. Parnas, "Concurrent control with readers and writers,"Commun. ACM, vol. 14, no. 2, pp. 667- 668, Oct. 1971.
[3] L. Lamport, "Concurrent reading and writing,"Commun. ACM, vol. 11, pp. 806-811, 1977.
[4] L. Lamport, "On interprocess communication, Parts I and II,"Distributed Comput., vol. 1, pp. 77-85 and 86-101, 1986.
[5] N. A. Lynch and M. Merritt, "Introduction to the theory of nested transactions," Tech. Rep. MIT-LCS-TR-367, Massachusetts Instit. Technol., 1986. Appeared inProc. 1986 Int. Conf. Database Theory.
[6] Lynch, N., and M. Tuttle, "Hierarchical Correctness Proofs for Distributed Algorithms," Tech. report, MIT Laboratory for Computer Science, Cambridge, Mass., Apr. 1987.
[7] R. Newman-Wolfe, "A protocol for wait-free, atomic, multireader shared variables," inProc. 6th Symp. Principles Distributed Comput., Vancouver, B.C., Canada, 1987.
[8] G. L. Peterson, "Time-space trade-offs for asynchronous parallel models: Reducibilities and equivalences," inProc. Eleventh Annu. ACM Symp. Theory Comput., Atlanta, GA, 1979, pp. 224-230.
[9] G. L. Peterson, "Concurrent reading while writing,"ACM TOPLAS, vol. 5, pp. 46-55, 1983.
[10] G. L. Peterson and J. E. Burns, "Concurrent reading while writing II: The multi-writer case," inProc. 28th Symp. Foundations Comput. Sci., Oct. 1987.
[11] G. L. Peterson and M. J. Fischer, "Economical solutions for the critical section problem in a distributed system," inProc. 9th STOC, pp. 91-97, May 1977.
[12] R. Schaffer, "Constructing multi-writer atomic registers," Bachelor's Thesis, MIT, 1988.
[13] A. A. Pal and M. B. Thompson. "An advanced interface to a switching software version management system," inProc. 7th Int. Conf. Software Engineering for Telecommunications Switching Systems, pp. 110-113, 1989.
[14] P. Vitányi and B. Awerbuch, "Atomic shared register access by asynchronous hardware," inProc. 27th IEEE Symp. Foundations Comput. Sci., 1986, pp. 233-243.

Index Terms:
two-writer; atomic registers; memory register; proof of correctness; two-writer protocol; computer architecture; protocols.
B. Bloom, "Constructing Two-Writer Atomic Registers," IEEE Transactions on Computers, vol. 37, no. 12, pp. 1506-1514, Dec. 1988, doi:10.1109/12.9729
Usage of this product signifies your acceptance of the Terms of Use.