Emerging high-performance computing platforms, with large component counts and lower power margins, are anticipated to be more susceptible to soft errors in both logic circuits and memory subsystems. We present an online algorithm-based fault tolerance (ABFT) approach to efficiently detect and recover soft errors for general iterative methods. We design a novel checksum-based encoding scheme for matrix-vector multiplication that is resilient to both arithmetic and memory errors. Our design decouples the checksum updating process from the actual computation, and allows adaptive checksum overhead control. Building on this new encoding mechanism, we propose two online ABFT designs that can effectively recover from errors when combined with a checkpoint/rollback scheme.
Revised: September 1, 2016 |
Published: May 31, 2016
Citation
Tao D., S. Song, S. Krishnamoorthy, P. Wu, X. Liang, E. Zhang, and D.J. Kerbyson, et al. 2016.New-Sum: A Novel Online ABFT Scheme For General Iterative Methods. In Proceedings of the 25th ACM international Symposium on High-Performance and Distributed Computing (HPDC 2016), May 31-June 4, 2016, Kyoto, Japan, 43-55. New York, New York:ACM.PNNL-SA-117061.doi:10.1145/2907294.2907306