Abstract
Taking a global snapshot in the absence of a global clock is a challenging issue in distributed system. The problem becomes more challenging when the communication channel is a non-FIFO one, due to the lack of FIFO properties in transmitting messages. Multiple initiators further complicate the situation. In this paper, we present a global snapshot collection algorithm with multiple initiators in the case of non-FIFO communication channel. We have shown that the algorithm can take a unique global consistent snapshot with non-FIFO channel, and terminates in O(mn 2) message complexity where m is the number of concurrent initiators, and n is the number of processes in the system.
This is a preview of subscription content, log in via an institution to check access.
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
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63–75 (1985)
Hélary, J.-M.: Observing global states of asynchronous distributed applications. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 124–135. Springer, Heidelberg (1989)
Chandrasekaran, S., Venkatesan, S.: A message-optimal algorithm for distributed termination detection. J. Parallel Distrib. Comput. 8(3), 245–252 (1990)
Lai, T.-H., Yang, T.H.: On distributed snapshots. Inf. Process. Lett. 25(3), 153–158 (1987)
Mattern, F.: Virtual time and global states of distributed system. In: Proceddings of the Workshop on Parallel and Distributed Algorithm, pp. 215–226 (1989)
Kshemkalyani, A.D.: A symmetric o(n log n) message distributed snapshot algorithm for large-scale systems. In: CLUSTER, pp. 1–4 (2009)
Garg, R., Garg, V.K., Sabharwal, Y.: Scalable algorithms for global snapshots in distributed systems. In: ICS, pp. 269–277 (2006)
Kshemkalyani, A.D.: Fast and message-efficient global snapshot algorithms for large-scale distributed systems. IEEE Trans. Parallel Distrib. Syst. 21(9), 1281–1289 (2010)
Koo, R., Toueg, S.: Checkpointing and rollback-recovery for distributed systems. IEEE Trans. Software Eng. 13(1), 23–31 (1987)
Spezialetti, M., Kearns, P.: Efficient distributed snapshots. In: ICDCS, pp. 382–388 (1986)
Prakash, R., Singhal, M.: Maximal global snapshot with multiple initiators, pp. 334–351 (1994)
Kumar, K.P.K., Hansdah, R.C.: An efficient and scalable checkpointing and recovery algorithm for distributed systems. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, pp. 94–99. Springer, Heidelberg (2006)
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
Goswami, D., Majumder, S. (2011). A Global Snapshot Collection Algorithm with Concurrent Initiators with Non-FIFO Channel. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24650-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-24650-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24649-4
Online ISBN: 978-3-642-24650-0
eBook Packages: Computer ScienceComputer Science (R0)