Abstract
This paper considers the shared memory wait-free atomic snapshot object in its simplest form where each cell contains a single bit. We demonstrate the ‘universality’ of this binary snapshot object by presenting an efficient linear-time implementation of the general multibit atomic snapshot object using an atomic binary snapshot object as a primitive. Thus, the search for an efficient (subquadratic or linear time) wait-free atomic snapshot implementation may be restricted to the binary case.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. In Proc. of the 9th Ann. ACM Symp. on Principles of Distributed Computing, pages 1–13, Aug. 1990.
Y. Afek, E. Gafni, J. Tromp, and P. M. B. Vitányi. Wait-free test-and-set. In Proc. of the 6th Int. Workshop on Distributed Algorithms, LNCS 647, pages 85–94. Springer Verlag, Nov. 1992.
J. H. Anderson. Composite registers. Technical Report TR-89-25, Department of Computer Science, The University of Texas at Austin, Sept. 1989.
J. H. Anderson. Multiple-writer composite registers. Technical Report TR-89-26, Department of Computer Science, The University of Texas at Austin, Sept. 1989.
J. H. Anderson. Composite registers. In Proc. of the 9th Ann. ACM Symp. on Principles of Distributed Computing, pages 15–29, Aug. 1990.
J. Aspnes and M. P. Herlihy. Wait-free data structures in the asynchronous pram model. In Proc. of the 2nd Ann. Symp. on Parallel Algorithms and Architectures, pages 340–349, Jul. 1990.
H. Attiya, M. Herlihy, and O. Rachman. Efficient atomic snapshots using lattice agreement. In Proc. of the 6th Int. Workshop on Distributed Algorithms, LNCS 647, pages 35–53. Springer Verlag, Nov. 1992.
B. Awerbuch, L. M. Kirousis, E. Kranakis, and P. M. B. Vitányi. On proving register atomicity. In Proc. of the 8th Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 286–303, 1988.
C. Dwork, M. Herlihy, S. A. Plotkin, and O. Waarts. Time-lapse snapshots. In Israel Symposium Theory of Computing and Systems, LNCS 601, pages 154–170. Springer Verlag, May 1992.
S. Haldar and K. Vidyasankar. Elegant constructions of atomic snapshot variables. Unpublished manuscript, May 1992.
Amos Israeli, Amnon Shaham, and Asaf Shirazi. Linear-time snapshot protocols for unbalanced systems. Technical Report CS-R9236, CWI, Sept. 1992.
L. M. Kirousis, P. Spirakis, and P. Tsigas. Reading many variables in one atomic operation: Solutions with linear or sublinear complexity. In Proc. of the 5th Int. Workshop on Distributed Algorithms, LNCS 579, pages 229–241. Springer Verlag, Oct. 1991.
L. Lamport. On interprocess communication part i: basic formalism. Distributed Computing, 1(2):77–85, 1986.
M. Li, J. Tromp, and P. M. B. Vitányi. How to share concurrent wait-free variables. Technical Report CS-R8916, CWI, Apr. 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoepman, JH., Tromp, J. (1993). Binary snapshots. In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_24
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive