Minimal Shared Information for Concurrent Reading and Writing

While there have been many register construction algorithms in the recent years, results establishing the intrinsic complexity of such constructions are scarce. In this paper, we establish the minimum shared memory necessary to construct an atomic single-writer, single-reader, N-bit register A from single-writer, single-reader, single bit safe registers. The write operation on A is wait-free, but the read operation is not. We also provide constructions that match our lower bounds.

[1]  Krishnamurthy Vidyasankar.  Converting Lamport's Regular Register to Atomic Register , 1988, Inf. Process. Lett..

[2]  John Tromp,et al.  How to construct an atomic variable , 1989 .

[3]  Bard Bloom.  Constructing Two-Writer Atomic Registers , 1988, IEEE Trans. Computers.

[4]  Leslie Lamport,et al.  Concurrent reading and writing , 1977, Commun. ACM.

[5]  Gary L. Peterson,et al.  Concurrent Reading While Writing , 1983, TOPL.

[6]  Krishnamurthy Vidyasankar,et al.  An Elegant 1-Writer Multireader Multivalued Atomic Register , 1989, Inf. Process. Lett..

[7]  Jennifer L. Welch,et al.  Bounds on the Costs of Register Implementations , 1991, WDAG.

[8]  Gary L. Peterson,et al.  Concurrent reading while writing II: The multi-writer case , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[9]  Baruch Awerbuch,et al.  Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  David Lorge Parnas,et al.  Concurrent control with “readers” and “writers” , 1971, CACM.

[11]  Gary L. Peterson,et al.  Constructing multi-reader atomic values from non-atomic values , 1987, PODC '87.

[12]  Richard Newman-Wolfe,et al.  A protocol for wait-free, atomic, multi-reader shared variables , 1987, PODC '87.

[13]  Ambuj K. Singh,et al.  The elusive atomic register revisited , 1987, PODC '87.

[14]  John Tromp.  How to Construct an Atomic Variable (Extended Abstract) , 1989, WDAG.

[15]  Gary L. Peterson.  A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables , 1983, TOPL.

[16]  Nancy A. Lynch,et al.  A hundred impossibility proofs for distributed computing , 1989, PODC '89.