Skip to main content
SpringerLink
Log in

How Hard Is It to Take a Snapshot?

  • Conference paper
SOFSEM 2005: Theory and Practice of Computer Science (SOFSEM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3381))

Abstract

The snapshot object is an important and well-studied primitive in distributed computing. This paper will present some implementations of snapshots from registers, in both asycnhronous and synchronous systems, and discuss known lower bounds on the time and space complexity of this problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory. JACM 40(4), 873–890 (1993)

    Article  MATH  Google Scholar 

  2. Anderson, J.: Multi-Writer Composite Registers. Distributed Computing 7(4), 175–195 (1994)

    Article  Google Scholar 

  3. Aspnes, J.: Time- and Space-Efficient Randomized Consensus. Journal of Algorithms 14(3), 414–431 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Aspnes, J., Herlihy, M.: Fast, Randomized Consensus Using Shared Memory. Journal of Algorithms 11(2), 441–461 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Aspnes, J., Herlihy, M.: Wait-Free Data Structures in the Asynchronous PRAM Model. In: 2nd ACM Symposium on Parallel Algorithms and Architectures, pp. 340–349 (1990)

    Google Scholar 

  6. Attiya, H., Fouren, A., Gafni, E.: An Adaptive Collect Algorithm with Applications. Distributed Computing 15, 87–96 (2002)

    Article  Google Scholar 

  7. Attiya, H., Herlihy, M., Rachman, O.: Atomic Snapshots Using Lattice Agreement. Distributed Computing 8, 121–132 (1995)

    Article  Google Scholar 

  8. Attiya, H., Lynch, N., Shavit, N.: Are Wait-free Algorithms Fast? JACM 41(4), 725–763 (1994)

    Article  MATH  Google Scholar 

  9. Attiya, H., Rachman, O.: Atomic Snapshots in O(n log n) Operations. SIAM Journal on Computing 27(2), 319–340 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Brodsky, A., Fich, F.E.: Efficient Synchronous Snapshots. In: 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 70–79 (2004)

    Google Scholar 

  11. Dwork, C., Herlihy, M., Waarts, O.: Bounded Round Numbers. In: 12th Annual ACM Symposium on Principles of Distributed Computing, pp. 53–64 (1993)

    Google Scholar 

  12. Dwork, C., Waarts, O.: Simple and Efficient Concurrent Timestamping or Bounded Concurrent Timestamps are Comprehensible. In: 24th Annual ACM Symposium on Theory of Computing, pp. 655–666 (1992)

    Google Scholar 

  13. Fatourou, P., Fich, F.E., Ruppert, E.: A Tight Time Lower Bound for Space-Optimal Implementations of Multi-Writer Snapshots. In: 35th Annual ACM Symposium on Theory of Computing, pp. 259–268 (2003)

    Google Scholar 

  14. Fatourou, P., Fich, F.E., Ruppert, E.: Space-Optimal Multi-Writer Snapshot Objects Are Slow. In: 21st Annual ACM Symposium on Principles of Distributed Computing, pp. 13–20 (2002)

    Google Scholar 

  15. Gawlick, R., Lynch, N., Shavit, N.: Concurrent Timestamping Made Simple. In: Dolev, D., Rodeh, M., Galil, Z. (eds.) ISTCS 1992. LNCS, vol. 601, pp. 171–183. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  16. Herlihy, M.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)

    Article  Google Scholar 

  17. Herlihy, M., Wing, J.: Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)

    Article  Google Scholar 

  18. Inoue, M., Chen, W., Masuzawa, T., Tokura, N.: Linear Time Snapshots Using Multi-writer Multi-reader Registers. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 130–140. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  19. Israeli, A., Li, M.: Bounded Time Stamps. Distributed Computing 6(4), 205–209 (1993)

    Article  MATH  Google Scholar 

  20. Israeli, A., Shaham, A., Shirazi, A.: Linear-Time Snapshot Implementations in Unbalanced Systems. Mathematical Systems Theory 28(5), 469–486 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  21. Israeli, A., Shirazi, A.: The Time Complexity of Updating Snapshot Memories. Information Processing Letters 65(1), 33–40 (1998)

    Article  MathSciNet  Google Scholar 

  22. Jayanti, P.: F-Arrays: Implementation and Applications. In: 21st Annual ACM Symposium on Principles of Distributed Computing, pp. 270–279 (2002)

    Google Scholar 

  23. Jayanti, P., Tan, K., Toueg, S.: Time and Space Lower Bounds for Nonblocking Implementations. SIAM Journal on Computing 30, 438–456 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  24. Neiger, G., Singh, R.: Space Efficient Atomic Snapshots in Synchronous Systems. Technical Report GIT-CC-93-46, Georgia Institute of Technology, College of Computing (1993)

    Google Scholar 

  25. Riany, Y., Shavit, N., Touitou, D.: Towards a Practical Snapshot Algorithm. Theoretical Computer Science 269, 163–201 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, Canada

    Faith Ellen Fich

Authors
  1. Faith Ellen Fich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Peter Vojtáš

  2. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava,  

    Mária Bieliková

  3. STIX, École Polytechnique, 91128, Palaiseau Cedex, France

    Bernadette Charron-Bost

  4. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fich, F.E. (2005). How Hard Is It to Take a Snapshot?. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30577-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24302-1

  • Online ISBN: 978-3-540-30577-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation