S. Haldar
Abstract
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.
- ~ASPNES, J., HERLIHY, M. P., AND SHAVIT, N. 1991. Counting networks and multi-processor ~coordination. In Proceedings of the 23rd Annual ACM Symposium on Theoly of Computing (New ~Orleans, La., May 6-8). ACM, New York, 348-358. Google Scholar
- ~AWERBUCH, B., KIROUSlS, L. M., KRANAKIS, E., AND VITANYI, P. M.B. 1988. A proof technique ~for register atomicity. In Proceedtngs of the 8th Conference on Foundations of Software Technol- ~ogy and Theoretical Computer Science (Pune, India, Dec. 21-23). Lecture Notes in Computer ~Science, vol. 338. Springer-Verlag, Berlin-Heidelberg-New York, 286-303. Google Scholar
- ~BURNS, J. E., AND PETERSON, G. L. 1987. Constructing multi-reader atomic values from ~non-atomic values. In Proceedings of the 6th AnnuaI ACM Symposium on Princtples of Distributed ~Computing (Vancouver, B. C., Canada, Aug. 10-12). ACM, New York, 222-231. Google Scholar
- ~BURNS, J. E., AND PETERSON, G.L. 1988. Sharp bounds for concurrent reading while writing. ~Tech. Rep. GIT-ICS-87/31 (Revised). Georgia Institute of Technology, Atlanta, Ga., June.Google Scholar
- ~DOLEV, S., ISRAELI, m., AND MORAN, S. 1990. Self-stabilization of dynamic systems assuming ~only read/write atomicity. In Proceedings of the 9th Annual ACM Symposium on Principles of ~Distributed Computing (Quebec, Ont., Canada, Aug. 22-24). ACM, New York, 103-117. Google Scholar
- ~HALDAR, S., AND VIDYASANKAR, K. 1992. Counterexamples to a 1-writer multireader atomic ~variable construction of Burns and Peterson, ACM Operating Systems Reviews 26, 1 (Jan.) ~78-88. Google Scholar
- ~HERLIHY, M. P., SHAVIT, N., AND WAARTS, O, 1991. Linearizable counting networks. In ~Proceedings of the 32nd Annual Symposium on Foundations of Computer Science. IEEE Com- ~puter Society Press, New York, 526-535. Google Scholar
- ~LAMPORT, L. 1986. On interprocess communication--Part I: Basic formalism, Part II: Algo- ~rithms. Dist. Comput. 1, 77-101.Google Scholar
- ~NEWMAN-WOLFE, R. 1987. A protocol for wait-free, atomic, multi-reader shared variables. In ~Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (Vancouver, ~B.C., Canada, Aug. 10-12). ACM, New York, 232-248. Google Scholar
- ~PETERSON, G.L. 1983. Concurrent reading while writing. ACM Trans. Prog. Lang. Syst. 5, 1 ~(Jan.), 46-55. Google Scholar
- ~S1NGH, A. K., ANDERSON, J. H., AND GOUDA, M, G. 1987/1994. The elusive atomic register. J. ~ACM 41, 2 (Mar.), 311-334. (A preliminary version, The elusive atomic register revisited, ~appeared in Proceedings of the 6th Annual ACM Symposium on Principles of Distlibuted ~Computing (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, 206-221.) Google Scholar
- ~VIDYASANKAR, K. 1988. Converting Lamport's regular register to atomic register. Inf. Proc. ~Lett. 28, 287-290. Google Scholar
- ~VIDYASANKAR, K. 1989. An elegant 1-writer multireader multivalued atomic register. Inf. Proc. ~Lett. 30, 221-223. Google Scholar
- ~VIDYASANKAR, K. 1990. Concurrent reading while writing revisited. Dist. Comput. 4, 81 85.Google Scholar
- ~VIDYASANKAR, a. 1991. A very simple construction of 1-writer multireader multivalued atomic ~variable. Inf. Proc. Lett. 37, 323-326. Google Scholar
Index Terms
- Constructing 1-writer multireader multivalued atomic variables from regular variables
Recommendations
On space-optimality of buffer-based conflict-free constructions of 1-writer 1-reader multivalued atomic variables from safe bits
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 ...
Bounded concurrent timestamp systems using vector clocks
Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication object, and has been shown to be a powerful tool to solve many concurrency control ...
Comments