An Efficient Checkpointing Method for Multicomputers with Wormhole Routing

Kai Li, Jeffrey F. Naughton and James S. Plank

International Journal of Parallel Processing, vol. 20, no. 3, June, 1992, pp 150-180.

Available via anonymous ftp to in



Efficient checkpointing and resumption of multicomputer applications is essential if multicomputers are to support time-sharing and the automatic resumption of jobs after a system failure. We present a checkpointing scheme that is transparent, imposes overhead only during checkpoints, requires minimal message logging, and allows for quick resumption of execution from a checkpointed image. Furthermore, the checkpointing algorithm allows each processor $p$ to continue running the application being checkpointed except during the time that $p$ is actively taking a local snapshot, and requires no global stop or freeze of the multicomputer. Since checkpointing multicomputer applications poses requirements different from those posed by checkpointing general distributed systems, existing distributed checkpointing schemes are inadequate for multicomputer checkpointing. Our checkpointing scheme makes use of special properties of wormhole routing networks to satisfy this new set of requirements.

Postscript of the paper