Abstract
We propose a concurrent partial snapshot algorithm (CSS algorithm) to extend a previously proposed sub-snapshot algorithm (SSS algorithm) [2] by introducing a method of merging multiple snapshots that are concurrently initiated by different nodes. In earlier work [5,6], efficient merging algorithms have already been introduced for CL algorithm. On the other hand, the main issue of our merging algorithm is to cope with dynamic situations based on SSS algorithm. Since the SSS algorithm is an extension of Chandy-Lamport snapshot algorithm (CL algorithm) [1], it allows large-scale and dynamic situations in snapshots. A dynamic situation means that nodes can join and leave freely during the execution of a snapshot algorithm. A snapshot algorithm for the dynamic situation has also been proposed [4]; however in this algorithm, nodes must stop sending application messages during its execution of the snapshot algorithm. Moreover, for concurrent snapshots, it has to cancel a portion of snapshot algorithms. Our algorithm has successfully removed these restrictions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chandy, K., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Trans. Computer Systems 3(1), 63–75 (1985)
Moriya, S., Araragi, T.: Dynamic Snapshot Algorithm and Partial Rollback Algorithm for Internet Agents. In: DISC 2001 Brief Announcements, pp. 23–28 (2001)
Moriya, S., Araragi, T.: Dynamic Snapshot Algorithm and Partial Rollback Algorithm for Internet Agents. IEICE Transactions on Information and Systems J86-D-I, 301–317 (2003) (in Japanese)
Koo, R., Toueg, S.: Checkpointing and Roll-back Recovery for Distributed Systems. IEEE Transactions on Software Engineering 13(1), 23–31 (1987)
Spezialetti, M., Kearns, P.: Efficient Distributed Snapshots. In: Proceedings of the 6th International Conference on Distributed Computing Systems, pp. 382–388 (1986)
Prakash, R., Singhal, M.: Maximal Global Snapshot with Concurrent Initiators. In: Proceedings of the 6th IEEE Symposium of Parallel and Distributed Processing, pp. 334–351 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, Y., Araragi, T., Nakamura, J., Masuzawa, T. (2011). Brief Announcement: A Concurrent Partial Snapshot Algorithm for Large-Scale and Dynamic Distributed Systems. In: Défago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-24550-3_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24549-7
Online ISBN: 978-3-642-24550-3
eBook Packages: Computer ScienceComputer Science (R0)