LOW-LATENCY, CONCURRENT CHECKPOINTING FOR PARALLEL PROGRAMS

This short note presents the results of an implementation of several a lgorithms for checkpointing and restarting parallel programs on shared -memory multiprocessors. The algorithms are compared according to the metrics of overall checkpointing time, overhead imposed by the checkpo inter on the target program, and amount of time during which the check pointer interrupts the target program. The best algorithm measured ach ieves its efficiency through a variation of copy-on-write, which allow s the most time-consuming operations of the checkpoint to be overlappe d with the running of the program being checkpointed.