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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory. JACM 40(4), 873–890 (1993)
Anderson, J.: Multi-Writer Composite Registers. Distributed Computing 7(4), 175–195 (1994)
Aspnes, J.: Time- and Space-Efficient Randomized Consensus. Journal of Algorithms 14(3), 414–431 (1993)
Aspnes, J., Herlihy, M.: Fast, Randomized Consensus Using Shared Memory. Journal of Algorithms 11(2), 441–461 (1990)
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)
Attiya, H., Fouren, A., Gafni, E.: An Adaptive Collect Algorithm with Applications. Distributed Computing 15, 87–96 (2002)
Attiya, H., Herlihy, M., Rachman, O.: Atomic Snapshots Using Lattice Agreement. Distributed Computing 8, 121–132 (1995)
Attiya, H., Lynch, N., Shavit, N.: Are Wait-free Algorithms Fast? JACM 41(4), 725–763 (1994)
Attiya, H., Rachman, O.: Atomic Snapshots in O(n log n) Operations. SIAM Journal on Computing 27(2), 319–340 (1998)
Brodsky, A., Fich, F.E.: Efficient Synchronous Snapshots. In: 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 70–79 (2004)
Dwork, C., Herlihy, M., Waarts, O.: Bounded Round Numbers. In: 12th Annual ACM Symposium on Principles of Distributed Computing, pp. 53–64 (1993)
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)
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)
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)
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)
Herlihy, M.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)
Herlihy, M., Wing, J.: Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)
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)
Israeli, A., Li, M.: Bounded Time Stamps. Distributed Computing 6(4), 205–209 (1993)
Israeli, A., Shaham, A., Shirazi, A.: Linear-Time Snapshot Implementations in Unbalanced Systems. Mathematical Systems Theory 28(5), 469–486 (1995)
Israeli, A., Shirazi, A.: The Time Complexity of Updating Snapshot Memories. Information Processing Letters 65(1), 33–40 (1998)
Jayanti, P.: F-Arrays: Implementation and Applications. In: 21st Annual ACM Symposium on Principles of Distributed Computing, pp. 270–279 (2002)
Jayanti, P., Tan, K., Toueg, S.: Time and Space Lower Bounds for Nonblocking Implementations. SIAM Journal on Computing 30, 438–456 (2000)
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)
Riany, Y., Shavit, N., Touitou, D.: Towards a Practical Snapshot Algorithm. Theoretical Computer Science 269, 163–201 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)