11th IEEE International On-Line Testing Symposium (2009)
June 24, 2009 to June 26, 2009
C. Argyrides , Department of Computer Science, University of Bristol, United Kingdom
L. Carro , Instituto de Informatica, PPGC, Universidade Federal do Rio Grande do Sul, Brasil
C. A. L. Lisboa , Instituto de Informatica, PPGC, Universidade Federal do Rio Grande do Sul, Brasil
D. K. Pradhan , Department of Computer Science, University of Bristol, United Kingdom
Temporal redundancy techniques will no longer be able to cope with radiation induced soft errors in technologies beyond the 45 nm node, because transients will last longer than the cycle time of circuits. The use of spatial redundancy techniques will also be precluded, due to their intrinsic high power and area overheads. The use of algorithm level techniques to detect and correct errors with low cost has been proposed in previous works, using a matrix multiplication algorithm as the case study. In this paper, a new approach to deal with this problem is proposed, in which the time required to recompute the erroneous element when an error is detected is minimized.
C. Argyrides, L. Carro, C. A. L. Lisboa, D. K. Pradhan, "A fast error correction technique for matrix multiplication algorithms", 11th IEEE International On-Line Testing Symposium, vol. 00, no. , pp. 133-137, 2009, doi:10.1109/IOLTS.2009.5195995