Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation

Journal of Parallel and Distributed Computing

Volumn 18, Issue 4, 1993, Pages 423-434

  Mattern, Friedemann ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001167874     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1993.1075     Document Type: Article

References (27)

1. Ahuja, M. Flush primitives for asynchronous distributed systems. Inform. Process. Lett. 34 (1990), 5-12.
2. Baldwin, R., Chung, M. J., and Chung, Y. Overlapping window algorithm for computing GVT in Time Warp. In Proc. Ilth International Conference on Distributed Computing Systems, 1991, pp. 534-541.
3. Bauer, H., Sporrer, C., and Krodel, T. H. On distributed logic simulation using Time Warp. In Proc. VLSI International Conference, 1FIP. Edinburgh, 1991.
4. Bellenot, S. Global virtual time algorithms. In Proc. of the SCS Multiconference on Distributed Simulation, 1990, pp. 122-127.
5. Chandy, K., and Lamport, L. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Systems 3, 1 (1985), 63-75.
6. Chandy, K., and Misra, J. Asynchronous distributed simulation via a sequence of parallel computations. Comm. ACM 24, 2 (1981), 198-205.
7. Chandy, K., Misra, J., and Haas, L. Distributed deadlock detection. ACM Trans. Comput. Systems 1, 2 (1983), 144-156.
8. Chang, E. Echo algorithms: Depth parallel operations on general graphs. IEEE Trans. Software Engrg. SE-8, 4 (1982), 391-401.
9. Critchlow, C., and Taylor, K. The inhibition spectrum and the achievement of causal consistency. In Proc. 9th ACM Symp. on Principles of Distributed Computing, 1990, pp. 31-42.
10. Fidge, J. Timestamps in message-passing systems that preserve the partial ordering. In Proc. Ilth Australian Computer Science Conference, 1988, pp. 56-66.
11. Fujimoto, R. M. Parallel discrete event simulation. Comm. ACM 33, 10 (1990), 30-53.
12. Hilary, J. Observing global states of asynchronous distributed applications. In Bermond, J-C., and Raynal, M. (Eds.). Proc. of the 3rd International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol. 392, Springer-Verlag, Berlin/New York, 1989, pp. 124-135.
13. Jefferson, D. Virtual time. ACM Trans. Programming Languages Systems, 7, 3 (1985), 404-425.
14. Koo, R., and Toueg, S. Checkpointing and rollback-recovery for distributed systems. IEEE Trans. Software Engrg. SE-13, 1 (1987), 23-31.
15. Lai, T., and Yang, T. On distributed snapshots. Inform. Process. Lett. 25 (1987). 153-158.
16. Lamport, L. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 7 (1978), 558-565.
17. Lin, Y. B., and Lazowska, D. Determining the global virtual time in a distributed simulation. In Proc. of the International Conference on Parallel Processing, 1990, pp. 201-209.
18. Mattem, F. Algorithms for distributed termination detection. Dis-tribut. Comput. 2 (1987). 161-175.
19. Mattern, F. Experience with a new distributed termination detection algorithm. In Van Leeuwen, J. (Ed.). Proc. of the 2nd International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, Vol. 312, Springer-Verlag, Berlin/New York. 1988, pp. 127-143.
20. Mattern, F. Virtual time and global states of distributed systems. In Cosnard, M., et al. (Eds). Proc. Workshop on Parallel and Distrib-uted Algorithms (Chateau de Bonas, France, Oct. 1988). Elsevier, 1989, pp. 215-226.
21. Mattem, F., Mehl, H., Schoone, A., and Tel, G. Global virtual time approximation with distributed termination detection algorithms. Tech. Rep. RUU-CS-91-32, Department of Computer Science, University of Utrecht, The Netherlands, 1991.
22. Misra, J. Distributed discrete-event simulation. Comput. Surveys 18, 1 (1986), 39-65.
23. Samadi, B., Muntz, R. R., and Parker, D. S. A distributed algorithm to detect a global state of a distributed simulation system. In Proc. IFIP Conference on Distributed Processing, North-Holland, Amsterdam, 1987.
24. Sarin, S., and Lynch, N. Discarding obsolete information in a replicated database system. IEEE Trans. Software Engrg. SE-13, I (1987), 39-47.
25. Segal, A. Distributed network protocols. IEEE Trans. Inform. Theory IT-29, 1 (1983), 23-35.
26. Taylor, K. The role of inhibition in asynchronous consistent-cut protocols. In Bermond, J-C., and Raynal, M. (Eds.). Proc. of the 3rd International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol. 392, Springer-Verlag, Berlin/New York, 1989, pp. 280-291.
27. Tel, G. Topics in Distributed Algorithms. Cambridge Univ. Press, Cambridge, 1991.