Skip to main content
SpringerLink
Log in

Linear-time snapshot implementations in unbalanced systems

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

Anatomic snapshot memory object in shared memory systems enables a set of processes, calledscanners, to obtain a consistent picture of the shared memory while other processes, calledupdaters, keep updating memory locations concurrently. In this paper we present two conversion methods of snapshot implementations. Using the first conversion method we obtain a new snapshot implementation in which the scan operation has linear time complexity and the time complexity of the update operation becomes the sum of the time complexities of the original implementation. Applying the second conversion method yields similar results, where in this case the time complexity of the update protocol becomes linear. Although our conversion methods use unbounded space, their space complexity can be bounded using known techniques.

One of the most intriguing open problems in distributed wait-free computing is the existence of a linear-time implementation of this object. Using our conversion methods and known constructions we obtain the following results:

  • •Consider a system ofn processes, each an updater and a scanner. We present an implementation in which the time complexity of either the update or the scan operation is linear, while the time complexity of the second operation isO(n logn).

  • •We present an implementation with linear time complexity when the number of either updaters or scanners isO(n/logn), wheren is the total number of processes.

  • •We present an implementation with amortized linear time complexity when one of the protocols (either upate or scan) is executed significantly more often than the other protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. U. Abraham. On Interprocess Communication and the Implementation of a Multi-Writer Atomic Register, Preprint.

  2. J. Anderson, Composite Registers,Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 15–29.

  3. I Anderson, Composite Registers,Distributed Computing, Vol. 6, No. 3, 1993, pp. 141–154.

    Google Scholar 

  4. J. Aspnes, Time- and Space-Efficient Randomized Consensus,Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 15–29.

  5. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M Merritt, and N. Shavit, Atomic Snapshots of Shared Memory,Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 1–13.

  6. J. Aspnes and M. Herlihy, Wait-Free Data Structures in the Asynchronous PRAM Model,Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures, 1990, pp. 340–349.

  7. H. Attiya, M. Herlihy, and O. Rachman, Efficient Atomic Snapshots Using Lattice Agreement,Proceedings of the 6th International Workshop on Distributed Algorithms and Graphs, Haifa, November 1992 (A. Segall and S. Zaks, eds.), pp. 35–53, Lecture Notes on Computer Science, Vol. 647, Springer-Verlag, Berlin, 1992.

    Google Scholar 

  8. H. Attiya, N. A. Lynch, and N. Shavit, Are Wait-Free Algorithms Fast?Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 55–64.

  9. H. Attiya and O. Rachman, Atomic Snapshots inO(n logn) Operations,Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, 1993.

  10. A. Ben-dor, A. Israeli, and A. Shirazi, On The Space Complexity of Snapshot Memories, Preprint.

  11. G. Bracha and O. Rachman, Randomized Consensus in ExpectedO(n 2 logn) Operations,Proceedings of the Fifth Workshop on Distributed Algorithms, 1991.

  12. T. D. Chandra and C. Dwork, Personal communications.

  13. C. Dwork, M. Herlihy, S. Plotkin, and O. Waarts, Time-Lapse Snapshots,Proceedings of the 1st Israeli Symposium on Theory of Computing and Systems, Haifa, May 1992 (D. Dolev, Z. Galil and M. Rodeh, eds.), pp. 154–170, Lecture Notes in Computer Science, Vol. 601, Springer-Verlag, Berlin, 1992.

    Google Scholar 

  14. C. Dwork, H. Herlihy, and O. Waarts, Bounded Round Numbers,Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, 1993.

  15. D. Dolev and N. Shavit, Bounded Concurrent Time-Stamp Systems Are Constructible!,Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 454–465.

  16. M. P. Herlihy. Impossibility and Universality Results for Wait-Free Synchronization,Proceedings of the 7th ACM Symposium on Principles of Distributed Computing, 1988, pp. 276–290.

  17. J. H. Hoepman and J. Tromp, Binary Snapshots,Proceedings of the 7th International Workshop on Distributed Algorithms and Graphs, Lausanne, September 1993, pp. 18–25, Lecture Notes in Computer Science, Vol. 725, Springer-Verlag, Berlin, 1993.

    Google Scholar 

  18. M. P. Herlihy and J. M. Wing, Linearizability: A Correctness Condition for Concurrent Objects,ACM Transactions on Programming Languages and Systems, Vol. 12, No. 3, July 1990, pp. 463–492.

    Google Scholar 

  19. M. Inoue, W. Chen, T. Masuzawa, and N. Tokura, Linear-Time Snapshot Using Multi-Writer Multi-Reader Registers,Proceedings of the 8th International Workshop on Distributed Algorithms and Graphs, 1994.

  20. A. Israeli, M. Li, and P. Vitanyi, Simple Multireader Registers Using Time-Stamp Schemes, Report No. CS-R8758 Center for Mathematics and Computer Science, Amsterdam, November 1987.

  21. A. Israeli and A. Shaham, Optimal Multi-Writer Multi-Reader Atomic Registers,Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, 1992, pp. 71–82.

  22. A. Israeli and A. Shirazi, Efficient Snapshot Protocol Using 2-Lattice Agreement, Preprint.

  23. A. Israeli and A. Shirazi, The Complexity of Updating Snapshot Memories, InformationProcessing Letters, to appear. Also inProceedings of the 2nd Annual European Symposium on Algorithms, 1994, pp. 171–182, Lecture Notes in Computer Science, Vol. 855, Springer-Verlag, Berlin, 1994.

    Google Scholar 

  24. L. M. Kirousis, P. Spirakis, and P. Tsigas, Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity,Proceedings of the 5th International Workshop on Distributed Algorithms and Graphs, Delphi, October 1991 (S. Toueg, P. Spirakis, and L. Kirousis, eds.), pp. 229–241, Lecture Notes in Computer Science, Vol. 579, Springer-Verlag, Berlin, 1992.

    Google Scholar 

  25. L. M. Kirousis, P. Spirakis, and P. Tsigas, Simple Atomic Snapshots, A Linear Complexity Solution with Unbounded Time-Stamps,Proceedings of Advances in Computing and Information—ICCI, 1991, pp. 582–587, Lecture Notes in Computer Science, Vol. 497, Springer-Verlag, Berlin, 1991.

    Google Scholar 

  26. L. Lamport, On Interprocess Communications. Part I: Basic Formalism,Distributed Computing, Vol. 1, No. 2 1986, pp. 77–85.

    Google Scholar 

  27. L. Lamport, On Interprocess Communication. Part II: Algorithms,Distributed Computing, Vol. 1, No. 2 1986, pp. 86–101.

    Google Scholar 

  28. N. Lynch and M. Tuttle, Hierarchical Correctness Proofs for Distributed Algorithms,Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1988, pp. 137–151.

  29. P. Vitanyi and B. Awerbuch, Atomic Shared Register Access by Asynchronous Hardware,Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 233–243.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Technion, 32000, Haifa, Israel

    A. Israeli

  2. Department of Computer Science, Technion, 32000, Haifa, Israel

    A. Shaham & A. Shirazi

Authors
  1. A. Israeli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Shaham
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Shirazi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A preliminary version of this paper appeared inProceedings of the Seventh Workshop on Distributed Algorithms, 1993. The first two authors were partially supported by NWO through NFI Project ALADDIN under Contract Number NF 62-376.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Israeli, A., Shaham, A. & Shirazi, A. Linear-time snapshot implementations in unbalanced systems. Math. Systems Theory 28, 469–486 (1995). https://doi.org/10.1007/BF01185868

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01185868

Keywords

Search

Navigation