This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 15th IEEE International On-Line Testing Symposium
A fast error correction technique for matrix multiplication algorithms
Sesimbra-Lisbon, Portugal
June 24-June 26
ISBN: 978-1-4244-4596-7
C. Argyrides, Department of Computer Science, University of Bristol, United Kingdom
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
L. Carro, Instituto de Informatica, PPGC, Universidade Federal do Rio Grande do Sul, Brasil
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.
Citation:
C. Argyrides, C. A. L. Lisboa, D. K. Pradhan, L. Carro, "A fast error correction technique for matrix multiplication algorithms," iolts, pp.133-137, 2009 15th IEEE International On-Line Testing Symposium, 2009
Usage of this product signifies your acceptance of the Terms of Use.