Algorithm-Based Fault Tolerance for Matrix Operations

IEEE Transactions on Computers

Volumn C-33, Issue 6, 1984, Pages 518-528

  Huang, Kuang Hua ^a   Abraham, Jacob A ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Algorithm based fault tolerance; checksum matrix; error correction; error detection matrix operations; multiple processor systems; processor arrays; systolic arrays; transient errors

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0021439162     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1984.1676475     Document Type: Article

References (22)

1. K. E. Batcher, “Design of a massively parallel processor,” IEEE Trans. Comput., vol. C-29, pp. 836–840, Sept. 1980.
2. H. T. Kung and C. E. Leiserson, “Algorithms for VLSI processor arrays,” in Introduction to VLSI Systems, C.A. Mead and L. A. Conway, Eds. Reading, MA: Addison-Wesley, 1980, pp. 271–292, sect. 8.3.
3. J. Von Neumann, “Probabilistic logics and the synthesis of reliable organisms from unreliable components,” Automata Studies, no. 34, pp. 43–99, Princeton Univ. Press.
4. J. G. Tryon, “Quadded logic,” in Redundancy Techniques for Computing Systems, Wilcox and Mann, Eds. Washington, DC: Spartan, 1962, pp. 205–228.
5. D. A. Anderson, “Design of self-checking digital networks using coding techniques,” Coord. Sci. Lab., Univ. Illinois, Tech. Rep. R-527.
6. D. A. Reynolds and G. Metze, “Fault detection capabilities of alternating logic.” IEEE Trans. Comput., vol. C-27, pp. 1093–1098, Dec. 1978.
7. J. H. Patel and L. Y. Fung, “Concurrent error detection in ALUs by recomputing with shifted operands,” IEEE Trans. Comput., vol. C-31, pp. 589–595, July 1982.
8. D. J. Lu, “Watchdog processors and structural integrity checking,” IEEE Trans. Comput., vol. C-31, pp. 681–685, July 1982.
9. Y. Crouzet and C. Landrault, “Design of self-checking MOS LSI circuits, application to a four-bit microprocessor,” IEEE Trans. Comput., vol. C-29, pp. 532–537, June 1980.
10. P. Banerjee and J. A. Abraham, “Fault characterization of VLSI MOS circuits,” in Proc. IEEE Int. Conf. Circuits Comput., New York, Sept. 1982, pp. 564–568.
11. R. W. Hamming, “Error detecting and error correcting codes,” Bell Syst. Tech. J., vol. 29, pp. 147–160, Jan. 1950.
12. J. J. Shedletsky, “Error correction by alternate-data retry,” IEEE Trans. Comput., vol. C-27, pp. 106–114, Feb. 1978.
13. W. Peterson and E.J. Weldon, Error-Correcting Codes. Cambridge, MA: MIT Press, 1972.
14. A. M. Patel and S. J. Hong, “Optimal rectangular code for high density magnetic tapes,” IBM J. Res. Develop., pp. 579–588, Nov. 1974.
15. R. L. Burden, J. D. Faires, and A.C. Reynolds, Numerical Analysis. Prindle, Weber & Schmidt, 1979, p. 321.
16. D. E. Knuth, The Art of Computer Programming, Vol. 2. Reading, MA: Addison-Wesley, 1969.
17. P. Elias, “Error-free coding,” Trans. IRE, vol. PGIT-4, pp. 29–37, 1954.
18. J. H. Wilkinson, Rounding Errors in Algebraic Processes. Englewood Cliffs, NJ: Prentice-Hall, 1963.
19. K.H. Huang, “Fault-tolerant algorithms for multiple processor systems,” Ph.D. dissertation, Dep. Comput. Sci., Univ. Illinois, 1983.
20. K.H. Huang and J. A. Abraham, “Efficient parallel algorithms for processor arrays,” in Proc. 1982 Int. Conf. Parallel Processing, Bellaire, MI, Aug. 24–27, 1982, pp. 271–279.
21. R. A. Willoughby, “Sparse matrix algorithms and their relation to problem classes and computer architecture,” in Large Sparse Sets of Linear Equations, J. K. Reid, Ed. New York: Academic, 1971, pp. 257–277.
22. J. A. C. Bingham, “A method of avoiding loss of accuracy in nodal analysis,” Proc. IEEE, pp. 409–410, 1967.