A Fault Tolerance Protocol with Fast Fault Recovery

Fault tolerance is an important issue for large machines with tens or hundreds of thousands of processors. Checkpoint-based methods, currently used on most machines, rollback all processors to previous checkpoints after a crash. This wastes a significant amount of computation as all processors have to redo all the computation from that checkpoint onwards. In addition, recovery time is bound by the time between the last checkpoint and the crash. Protocols based on message logging avoid the problem of rolling back all processors to their earlier state. However, the recovery time of existing message logging protocols is no smaller than the time between the last checkpoint and crash. We present a fault tolerance protocol, in this paper, that provides fast restarts by using the ideas of message logging and object-based processor virtualization. We evaluate our implementation of the protocol in the Charm++/Adaptive MPI runtime system. We show that our protocol provides fast restarts and, f...

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Sayantan Chakravorty, Laxmikant V. Kalé
• Keywords: Distributed And Parallel Computing, Fault Tolerance, IPPS 2007, Message Logging, Recovery Time