Brief Announcement: A Concurrent Partial Snapshot Algorithm for Large-Scale and Dynamic Distributed Systems
We propose a concurrent partial snapshot algorithm (CSS algorithm) to extend a previously proposed sub-snapshot algorithm (SSS algorithm)  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) , 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 ; 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.
- 2.Moriya, S., Araragi, T.: Dynamic Snapshot Algorithm and Partial Rollback Algorithm for Internet Agents. In: DISC 2001 Brief Announcements, pp. 23–28 (2001)Google Scholar
- 3.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)Google Scholar
- 5.Spezialetti, M., Kearns, P.: Efficient Distributed Snapshots. In: Proceedings of the 6th International Conference on Distributed Computing Systems, pp. 382–388 (1986)Google Scholar
- 6.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)Google Scholar