Efficient checkpointing over local area networks

Proceedings of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, FTPDS 1994

Volumn , Issue , 1994, Pages 30-35

  Ziv, A ^a   Bruck, J ^b  

^a STANFORD UNIVERSITY   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COST EFFECTIVENESS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS;

ANALYTICAL RESULTS; CHECKPOINTING SCHEMES; CLUSTERS OF WORKSTATIONS; COMMUNICATION SUBSYSTEMS; ETHERNET TECHNOLOGY; HIGH PERFORMANCE COMPUTING; PARALLEL AND DISTRIBUTED COMPUTING; STORAGE SUBSYSTEMS;

LOCAL AREA NETWORKS;

EID: 33747067045     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FTPDS.1994.494471     Document Type: Conference Paper

References (6)

1. K. M. Chandy and C. V. Ramamoorthy. Rollback and recovery strategies for computer programs. IEEE Transactions on Computers, 21:546-556, June 1972.
2. T. A. Cover and J. A. Thomas. Elements of Information Theory. John Wiley, 1991.
3. J. Long, W. K. Puchs, and J. A. Abraham. Forward recovery using checkpointing in parallel systems. In The 19th International Conference on Parallel Processing, pages 272-275, August 1990.
4. D. K. Pradhan. Redundancy schemes for recovery. TR-89-cse-16, ECE Department, University of Massachusetts, Amherst, 1989.
5. A. S. Tanenbaum. Computer Networks. Prentice-Hall, 1989.
6. A. Ziv and J. Bruck. Analysis of checkpointing schemes for multiprocessor systems. In The 13th symposium on Reliable Distributed Systems, pages 52-61, October 1994.