Efficient distributed snapshots in an anonymous asynchronous message-passing system

Journal of Parallel and Distributed Computing

Volumn 73, Issue 5, 2013, Pages 621-629

  Kshemkalyani, Ajay D ^a   Singhal, Mukesh ^b  

^a University of Illinois at Chicago   (United States)

^b University of California   (United States)

Author keywords

Anonymous systems; Causality; Distributed computing; Global snapshot; Global state; Termination detection

Indexed keywords

COMPUTATIONAL COMPLEXITY; MESSAGE PASSING;

ANONYMOUS SYSTEMS; CAUSALITY; GLOBAL SNAPSHOT; GLOBAL STATE; TERMINATION DETECTION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84893672822     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2013.01.003     Document Type: Article

References (20)

1. A. Acharya, B.R. Badrinath, Recording distributed snapshots based on causal order of message delivery, Inform. Process. Lett. 44 (1992) 317-321.
2. S. Alagar, S. Venkatesan, An optimal algorithm for distributed snapshots with causal message ordering, Inform. Process. Lett. 50 (1994) 311-316.
3. D. Angluin, Local and global properties in networks of processors, in : Proceedings of the 12th ACM Symposium on Theory of Computing, 1980, pp. 82-93.
4. R. Baldoni, G. Cioffi, J.-M. Helary, M. Raynal, Direct dependency-based determination of consistent global checkpoints, Comput. Syst. Sci. Eng. 16 (1) (2001) 43-49.
5. J. Chalopin, E. Godard, Y. Metivier, Local terminations and distributed computability in anonymous networks, in: Proceedings of DISC, in: LNCS, 2008, pp. 47-62.
6. J. Chalopin, Y. Metivier, T. Morsellino, On Snapshots and stable properties detection in anonymous fully distributed systems (Extended abstract), in: Proceedings of SIROCCO, in: LNCS, vol. 7355, Springer, 2012, pp. 207-218.
7. K.M. Chandy, L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Trans. Comput. Syst. 3 (1) (1985) 63-75.
8. R.G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimumweight spanning trees, ACM Trans. Program. Lang. Syst. (TOPLAS) 5 (1) (1983) 66-77.
9. R. Guerraoui, E. Ruppert, What can be implemented anonymously? in: Proceedings of DISC 2005, Springer, 2005, pp. 244-259.
10. J.-M. Helary, Observing global states of asynchronous distributed applications, in: Proceedings of the 3rd International Workshop on Distributed Algorithms, in: LNCS, vol. 392, Springer Verlag, 1989, pp. 124-134.
11. A.D. Kshemkalyani, M. Raynal, M. Singhal, An introduction to snapshot algorithms in distributed computing, Distrib. Syst. Eng. J. 2 (4) (1995) 224-233.
12. A.D. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms, and Systems, Cambridge University Press, 2008.
13. A.D. Kshemkalyani, Fast and message-efficient global snapshot algorithms for large-scale distributed systems, IEEE Trans. Parallel Distrib. Syst. 21 (9) (2010) 1281-1289.
14. T.H. Lai, T.H. Yang, On distributed snapshots, Inform. Process. Lett. 25 (1987) 153-158.
15. D. Manivannan, R.H.B Netzer, M. Singhal, Finding consistent global checkpoints in a distributed computation, IEEE Trans. Parallel Distrib. Syst. 8 (6) (1997) 623-627.
16. F.H. Mathis, A generalized birthday problem, SIAM Rev. 33 (2) (1991) 265-270.
17. F. Mattern, Algorithms for distributed termination detection, Distrib. Comput. 2 (3) (1987) 161-175.
18. F. Mattern, Efficient algorithms for distributed snapshots and global virtual time approximation, J. Parallel Distrib. Comput. 18 (1993) 423-434.
19. M. Spezialetti, P. Kearns, Efficient distributed snapshots, in: IEEE ICDCS 1986, pp. 61-68.
20. B. Szymanski, Y. Shy, N. Prywes, Synchronized distributed termination, IEEE Trans. Software Eng. 11 (10) (1985) 1136-1140.