Advertisement

Binary snapshots

  • Jaap-Henk Hoepman
  • John Tromp
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 725)

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.

Keywords

snapshot shared memory atomicity linearisability waitfree implementations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    J. H. Anderson. Composite registers. Technical Report TR-89-25, Department of Computer Science, The University of Texas at Austin, Sept. 1989.Google Scholar
  4. 4.
    J. H. Anderson. Multiple-writer composite registers. Technical Report TR-89-26, Department of Computer Science, The University of Texas at Austin, Sept. 1989.Google Scholar
  5. 5.
    J. H. Anderson. Composite registers. In Proc. of the 9th Ann. ACM Symp. on Principles of Distributed Computing, pages 15–29, Aug. 1990.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    S. Haldar and K. Vidyasankar. Elegant constructions of atomic snapshot variables. Unpublished manuscript, May 1992.Google Scholar
  11. 11.
    Amos Israeli, Amnon Shaham, and Asaf Shirazi. Linear-time snapshot protocols for unbalanced systems. Technical Report CS-R9236, CWI, Sept. 1992.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    L. Lamport. On interprocess communication part i: basic formalism. Distributed Computing, 1(2):77–85, 1986.Google Scholar
  14. 14.
    M. Li, J. Tromp, and P. M. B. Vitányi. How to share concurrent wait-free variables. Technical Report CS-R8916, CWI, Apr. 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jaap-Henk Hoepman
    • 1
  • John Tromp
    • 1
  1. 1.Centre for Mathematics and Computer Science (CWI)AmsterdamThe Netherlands

Personalised recommendations