Numerical Defect Correction as an Algorithm-Based Fault Tolerance Technique for Iterative Solvers

被引：11
|
作者：
Oboril, Fabian [1 ]
Tahoori, Mehdi B. [1 ]
Heuveline, Vincent [2 ]
Lukarski, Dimitar [3 ]
Weiss, Jan-Philipp [3 ]
机构：
[1] Karlsruhe Inst Technol KIT, Chair Dependable Nano Comp CDNC, Karlsruhe, Germany
[2] Karlsruhe Inst Technol KIT, Engn Math & Comp Lab EMCL, Karlsruhe, Germany
[3] Karlsruhe Inst Technol KIT, Shared Res Grp New Frontiers High Performance, Comp Exploit Multicore & Coprocessor Technol, Karlsruhe, Germany
来源：
2011 IEEE 17TH PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC) | 2011年
关键词：
algorithm-based fault tolerance; defect correction; conjugated gradient; triple modular redundancy; checkpointing;
D O I：
10.1109/PRDC.2011.26
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
As hardware devices like processor cores and memory sub-systems based on nano-scale technology nodes become more unreliable, the need for fault tolerant numerical computing engines, as used in many critical applications with long computation/mission times, is becoming pronounced. In this paper, we present an Algorithm-based Fault Tolerance (ABFT) scheme for an iterative linear solver engine based on the Conjugated Gradient method (CG) by taking the advantage of numerical defect correction. This method is "pay as you go", meaning that there is practically only a runtime overhead if errors occur and a correction is performed. Our experimental comparison with software-based Triple Modular Redundancy (TMR) clearly shows the runtime benefit of the proposed approach, good fault tolerance and no occurrence of silent data corruption.
引用
收藏
页码：144 / 153
页数：10
相关论文
共 50 条
12345