Constructing 1-writer multireader multivalued atomic variables from regular variables

A simple wait-free construction of 1-writer multireader multivalued atomic variable from multireader regular variables is presented in this paper. A key point of the construction is the use of an elegant forwarding technique to overcome the new-old inversion property inherent in regular variables. Another construction, using a different forwarding technique, is also given. This technique is a refinement of one proposed in the literature. Formal correctness proofs for both the constructions are short and easy to follow.

[1]  Ambuj K. Singh,et al.  The elusive atomic register , 1994, JACM.

[2]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

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

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

[5]  Maurice Herlihy,et al.  Low contention linearizable counting , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[7]  Krishnamurthy Vidyasankar.  A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable , 1991, Inf. Process. Lett..

[8]  Maurice Herlihy,et al.  Counting networks and multi-processor coordination , 1991, STOC '91.

[9]  Amos Israeli,et al.  Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity , 1990, PODC.

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

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

[12]  Krishnamurthy Vidyasankar,et al.  Counterexamples to a one writer multireader atomic variable construction of Burns and Peterson , 1992, OPSR.

[13]  Baruch Awerbuch,et al.  A Proof Technique for Register Automicity , 1988, FSTTCS.