A Survey of Rollback-Recovery Protocols in Message-Passing Systems

ACM Computing Surveys

Volumn 34, Issue 3, 2002, Pages 375-408

  Elnozahy, E N ^a   Alvisi, Lorenzo ^b   Wang, Yi Min ^c   Johnson, David B ^d  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

^b University of Texas at Austin   (United States)

^c MICROSOFT   (United States)

^d Rice University   (United States)

Author keywords

Message logging; Rollback recovery

Indexed keywords

MESSAGE LOGGING; ROLLBACK-RECOVERY PROTOCOLS;

COMPUTER SYSTEMS PROGRAMMING; ENCODING (SYMBOLS); FAULT TOLERANT COMPUTER SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS; RELIABILITY;

NETWORK PROTOCOLS;

EID: 0042078549     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/568522.568525     Document Type: Review

References (63)

1. ALVISI, L. 1996. Understanding the Message Logging Paradigm for Masking Process Crashes. Ph.D. Thesis, Cornell University, Department of Computer Science.
2. ALVISI, L. AND MARZULLO, K. 1998. Message logging: pessimistic, optimistic, causal and optimal. IEEE Trans. Softw. Eng. 24, 2, 149-159.
3. ALVISI, L., ELNOZAHY, E. N., RAO, S., HUSAIN, S. A., and MEL, A. D. 1999. An analysis of communication-induced checkpointing. In Digest of Papers, FTCS-29, The Twenty Nineth Annual International Symposium on FaultTolerant Computing (Madison, Wisconsin), 242-249.
4. APPEL, A. W. 1989. A runtime system. Technical Report CS-TR220-89, Department of Computer Science, Princeton University.
5. BABAOGLU, O. AND JOY, W. 1981. Converting a swap-based system to do paging in an architecture lacking page-reference bits. In Proceedings of the Eighth ACM Symposium on Operating Systems Principles, 78-86.
6. BALDONI, R., QUAGLIA, P., AND CICIANI, B. 1998. A VP- accordant checkpointing protocol preventing useless checkpoints. In Proceedings, Seventeenth Symposium on Reliable Distributed Systems, 61-67.
7. BANÂTRE, J. P., BANÂTRE, M., AND MULLER, G. 1988. Ensuring data security and integrity with a fast stable storage. In Proceedings of The Fourth Conference on Data Engineering, 285-293.
8. BARTLETT, J. F. 1981. A Non Stop Kernel. In Proceedings of the Eighth ACM Symposium on Operating Systems Principles, 22-29.
9. BEGUELIN, A., SELIGMAN, E., AND STEPHAN, P. 1997. Application-level fault tolerance in heterogeneous networks of workstations. J. Parallel and Distributed Comput. 43, 2, 147-155.
10. BHARGAVA, B. AND LIAN, S. R. 1988. Independent checkpointing and concurrent rollback for recovery - An optimistic approach. In Proceedings, Seventh Symposium on Reliable Distributed Systems, 3-12.
11. BHAHGAVA, B., LIAN, S. R., AND LEU, P. J. 1990. Experimental evaluation of concurrent checkpointing and rollback-recovery algorithms. In Proceedings of the Sixth International Conference on Data Engineering, 182-189.
12. BORG, A., BLAU, W., GRAETSCH, W., HERMANN, P., AND OBERLE, W. 1989. Fault tolerance under UNIX. ACM Trans. Comput. Syst. 7, 1, 1-24.
13. BRESSOUD, T. C. AND SCHNEIDER, P. B. 1995. Hypervisor-based fault tolerance. In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, 1-11.
14. BRIATICO, D., CIUFFOLETTI, A., AND SIMONCINI, L. 1984. A distributed domino-effect free recovery algorithm. In IEEE International Symposium on Reliability, Distributed Software, and Databases, 207-215.
15. CHANDY, M. AND RAMAMOORTHY, C. V. 1972. Rollback and recovery strategies for computer programs. IEEE Trans. Comput. 21, 6, 546-556.
16. CHANDY, M. AND LAMPORT, L. 1985. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comut. Syst. 31, 1, 63-75.
17. CRISTIAN, F. AND JAHANIAN, F. 1991. A timestampbased checkpointing protocol for long-lived distributed computations. In Proceedings, Tenth Symposium on Reliable Distributed Systems, 12-20.
18. ELNOZAHY, B. N. 1993. Manetho: Fault Tolerance in Distributed Systems using Rollback-Recovery and Process Replication. Ph.D. Thesis, Rice University, Department of Computer Science.
19. ELNOZAHY, E. N. 1998. How safe is probabilistic checkpointing? In Digest of Papers, FTCS-28, the Twenty Eight Annual International Symposium on Fault-Tolerant Computing, 358-363.
20. ELNOZAHY, E. N. AND ZWAENEPOEL, W. 1994. On the use and implementing of message logging. In Digest of Papers, FTCS-24, The Twenty Fourth International Symposium on Fault-Tolerant Computing, 298-307.
21. ELNOZAHY, E. N., JOHNSON, D. B., AND ZWAENEPOEL, W. 1992. The performance of consistent check-pointing. In Proceedings, Eleventh Symposium on Reliable Distributed Systems, 39-47.
22. FELDMAN, S. I. AND BROWN, C. B. 1989. Igor: A system for program debugging via reversible execution. ACM SIGPLAN Notices, Workshop on Parallel and Distributed Debugging 24, 1, 112-123.
23. GOLDBERG, A., GOPAL, A., Li, K., STROM, R., AND BACON, D. 1990. Transparent recovery of Mach applications. In Usenix Mach Workshop Proceedings, 169-184.
24. HÉLAHY, J. M., MOSTEFAOUI, A., AND RAYNAL, M. 1997a. Virtual precedence in asynchronous systems: concepts and applications. In Proceedings of the 11th Workshop on Distributed Algorithms, WDAG'97.
25. HÉLARY, J. M., MOSTEFAOUI, A., NETZER, R. H., AND RAYNAL, M. 1997b. Preventing useless checkpoints in distributed computations. In Proceedings, Sixteenth Symposium on Reliable Distributed Systems, 183-190.
26. HUANG, Y. AND KINTALA, C. 1993. Software implemented fault tolerance: Technologies and experience. In Digest of Papers, FTCS-23, the Twenty Third Annual International Symposium on Fault-Tolerant Computing, 2-9.
27. HUANG, Y. AND WANG, Y.-M. 1995. Why optimistic message logging has not been used in telecommunication systems. In Digest of Papers, FTCS25, the Twenty Fifth Annual International Symposium on Fault-Tolerant Computing, 459-463.
28. JOHNSON, D. B. 1989. Distributed System Fault Tolerance Using Message Logging and Check-pointing. Ph.D. Thesis, Rice University, Department of Computer Science.
29. JOHNSON, D. B. AND ZWAENEPOEL, W. 1987. Sender-based message logging. In Digest of Papers, FTCS-17, The Seventeenth Annual International Symposium on Fault-Tolerant Computing, 14-19.
30. JOHNSON, D. B. AND ZWAENEPOEL, W. 1990. Recovery in distributed systems using optimistic message logging and checkpointing. J. Algorithms 11, 3, 462-491.
31. JUANG, T. T.-Y. AND VENKATESAN, S. 1991. Crash recovery with little overhead. In Proceedings, The 11th International Conference on Distributed Computing Systems, 454-461.
32. KOO, R. AND TOUEG, S. 1987. Checkpointing and rollback-recovery for distributed systems. IEEE Trans. Softw. Engin. 13, 1, 23-31.
33. LAI, T. H. AND YANG, T. H. 1987. On distributed snapshots. Information Processing Letters 25, 153-158.
34. LAMPORT, L. 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7, 588-565.
35. LAMPSON, B. W. AND STURGIS, H. E. 1979. Crash recovery in a distributed data storage system. Technical Report, Xerox Palo Alto Research Center.
36. LI, C. C. AND FUCHS, W. K. 1990. CATCH: Compilerassisted techniques for checkpointing. In Digest of Papers, FTCS-20, The Twentieth Annual International Symposium on Fault-Tolerant Computing, 74-81.
37. MELLOR-CRUMMEY, J. AND LEBLANC, T. 1989. A software instruction counter. In Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems, 78-86.
38. MORIN, C. AND PUAUT, T. 1997. A survey of recoverable distributed shared memory systems. IEEE Trans. Parallel and Distributed Syst. 8, 9, 959-969.
39. MULLER, G., HUE, M., AND PEYROUZ, N. 1994. Performance of consistent checkpointing in a modular operating system: Results of the FTM experiment. In Lecture Notes in Computer Science: Dependable Computing, EDDC-1, 491-508.
40. NAM, H.-C., KIM, J., HONG, S. J., AND LEE, S. 1997. Probabilistic checkpointing. In Digest of Papers, FTCS-27, The Twenty Seventh Annual International Symposium on Fault-Tolerant Computing, 48-57.
41. NETZER, R. H. AND Xu, J. 1995. Necessary and sufficient conditions for consistent global snapshots. IEEE Trans. Parallel and Distributed Syst. 6, 2, 165-169.
42. PAUSOH, R. 1988. Adding Input and Output to the Transactional Model. Ph.D. Thesis, Carnegie Mellon University, Department of Computer Science.
43. PLANK, J. S. 1993. Efficient Checkpointing on MIMD Architectures. Ph.D. Thesis, Princeton University, Department of Computer Science.
44. PLANK, J. S. AND Li, K. 1994. Faster checkpointing with N +1 parity. In Digest of Papers, FTCS-24, The Twenty Fourth Annual International Symposium on Fault-Tolerant Computing, 288-297.
45. PLANK, J. S., Xu, J., AND NETZER, R. H. 1995a. Compressed differences: An algorithm for fast incremental checkpointing. Technical Report CS-95-302, University of Tennessee at Knoxville.
46. PLANK, J. S., BECK, M., KINGSLEY, G., AND LT, K. 1995b. Libckpt: Transparent checkpointing under UNIX. In Proceedings of the USENIX Winter 1995 Technical Conference, 213-223.
47. PRAKASH, R. AND SINGHAL, M. 1996. Low-cost check-pointing and failure recovery in mobile computing systems. IEEE Trans. Parallel and Distributed Syst. 7, 10, 1035-1048.
48. RANDELL, B. 1975. System structure for software fault tolerance. IEEE Trans. Softw. Engin, 1, 2, 220-232.
49. RAO, S., ALVISI, L., AND VIN, H. M. 1998. The cost of recovery in message logging protocols. In Proceedings, Seventeenth Symposium on Reliable Distributed Systems, 10-18.
50. RUFFIN, M. 1992. KITLOG: A generic logging service. In Proceedings, Eleventh Symposium on Reliable Distributed Systems, 139-148.
51. RUSSELL, D. L. 1980. State restoration in systems of communicating processes. IEEE Trans. Softw. Engin. 6, 2, 183-194.
52. SCHLICHTUNG, R. D. AND SCHNEIDER, F. B. 1983. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Trans. Comput. Syst. 1, 3, 222-238.
53. SILVA, L. M. 1997. Checkpointing Mechanisms for Scientific Parallel Applications. Ph.D. Thesis, University of Coimbra, Department of Computer Science.
54. SISTLA, A. AND WELCH, J. 1989. Efficient distributed recovery using message logging. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (PODC), 223-238.
55. SLYE, J. H. AND ELNOZAHY, E. N. 1998. Support for software interrupts in log-based rollback-recovery. IEEE Trans. Comput. 47, 10, 1113-1123.
56. SMITH, S. W. AND JOHNSON, D. B. 1996. Minimizing timestamp size for completely asynchronous optimistic recovery with minimal rollback. In Proceedings, the Fifteenth Symposium on Reliable Distributed Systems, 66-75.
57. STROM, R. AND YEMINI, S. 1985. Optimistic recovery in distributed systems. ACM Trans. Comput. Syst. 3, 3, 204-226.
58. TAMIR, Y. AND SEQUIN, C. H. 1984. Error recovery in multicomputers using global checkpoints. In Proceedings of the International Conference on Parallel Processing, 32-41.
59. TONG, Z., KAIN, R. Y., AND TSAI, W. T. 1992. Rollback-recovery in distributed systems using loosely synchronized clocks. IEEE Trans. Parallel and Distributed Syst. 3, 2, 246-251.
60. WANG, Y.-M. 1993. Space Reclamation for Uncoordinated Checkpointing in Message-Passing Systems. Ph.D. Thesis, University of Illinois, Department of Computer Science.
61. WANG, Y.-M. 1997. Consistent global checkpoints that contain a set of local checkpoints. IEEE Trans. Comput. 46, 4, 456-468.
62. WANG, Y.-M., CHUNG, P. Y., AND FUCHS, W. K. 1995a. Tight upper bound on useful distributed system checkpoints. Technical Report, University of Illinois.
63. WANG, Y.-M., CHUNG, P. Y., LIN, I. J., AND FUCHS, W. K. 1995b. Checkpoint space reclamation for uncoordinated checkpointing in message-passing systems. IEEE Trans. Parallel and Distributed Syst. 6, 5, 546-554.