Issue No. 12 - December (2008 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.58
Zizhong Chen , University of Tennessee, Knoxville
Jack Dongarra , University of Tennessee, Knoxville
Fail-stop failures in distributed environments are often tolerated by checkpointing or message logging. In this paper, we show that fail-stop process failures in ScaLAPACK matrix-matrix multiplication kennel can be tolerated without checkpointing or message logging. It has been proved in previous algorithm-based fault tolerance that, for matrix-matrix multiplication, the checksum relationship in the input checksum matrices is preserved at the end of the computation no mater which algorithm is chosen. From this checksum relationship in the final computation results, processor miscalculations can be detected, located, and corrected at the end of the computation. However, whether this checksum relationship can be maintained in the middle of the computation or not remains open. In this paper, we first demonstrate that, for many matrix matrix multiplication algorithms, the checksum relationship in the input checksum matrices is not maintained in the middle of the computation. We then prove that, however, for the outer product version algorithm, the checksum relationship in the input checksum matrices can be maintained in the middle of the computation. Based on this checksum relationship maintained in the middle of the computation, we demonstrate that fail-stop process failures (which are often tolerated by checkpointing or message logging) in ScaLAPACK matrix-matrix multiplication can be tolerated without checkpointing or message logging.
Reliability and robustness, Mathematical Software, Parallel algorithms
Z. Chen and J. Dongarra, "Algorithm-Based Fault Tolerance for Fail-Stop Failures," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 1628-1641, 2008.