Advertisement

Arithmetic-Based Diagnosis in VLSI Array Processors

  • Andrzej Rucinski
  • Weicheng Shen

Abstract

Existing literature on reliable VLSI array processors can be divided into two categories: easy-testable techniques and fault-tolerant techniques. The easy-testable techniques allow an array to be modified in such a way that the testing time is independent of the array size [1] – [4]. This approach exploits the structural properties of iterative arrays which are modeled as combinational circuits. Different testability conditions have been established [5], [6] to determine the observability and controllability of a test vector. Still, these approaches may be impractical since they assume an exhaustive testing of a single processor in the array. The fault-tolerant techniques which do not require a massive redundancy utilize algorithmic properties of matrix operations [7], [8]. The methods encode data at a high level, and algorithms are designed to operate on encoded data and produce encoded i. e. corrected output data. However the approach has to be “customized” any time it is applied to a specific algorithm.

Keywords

Multiple Fault Combinational Circuit Subsequent Successor Faulty Processor Reconfiguration Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    P.R. Menon and A.D. Friedman, “Fault detection in iterative logic arrays”, IEEE Trans. Compute., vol.C-20, pp. 524–535, May 1971.CrossRefGoogle Scholar
  2. [2]
    B.A. Prasad and F.C. Gray, “Multiple fault detection in arrays of combinational cells”, IEEE Trans. Comput., vol.C-24, pp.794–802, Aug. 1975.MathSciNetCrossRefGoogle Scholar
  3. [3]
    R. Parthasarathy and S.M. Reddy, “A testable design of iterative logic arrays”, IEEE Trans. Comput., vol.C-30, pp. 833–841, Nov. 1981.MathSciNetCrossRefGoogle Scholar
  4. [4]
    H. Elhuni, A. Vergis, and L. Kinney, “C-Testability of two-dimensional iterative arrays”, IEEE Trans. Comput.-Aided Design, vol.CAD-5, pp. 573–581, Oct. 1986.CrossRefGoogle Scholar
  5. [5]
    A. Vergis and K. Steiglitz, “Testability conditions for bilateral arrays of combinational cells”, IEEE Trans. Comput., vol.C-35, pp. 13–22, Jan. 1986.CrossRefGoogle Scholar
  6. [6]
    D. Sciuto and F. Lombardi, “New conditions for testability of two-dimensional bilateral arrays”, Proc. Int. Conf. on Systolic Systems, pp. 495-504, May 1988.Google Scholar
  7. [7]
    K.H. Huang and J.A. Abraham, “Algorithm-based fault tolerance for matrix operations”, IEEE Trans. Comput., vol.C-33, pp. 518–528, June 1984.CrossRefGoogle Scholar
  8. [8]
    W.S. Song and B.R. Musicus, “A fault-tolerant architecture for a parallel digital signal processing machine”, ICCD’87, Oct. 1987.Google Scholar
  9. [9]
    J. Savir, G.S. Ditlow, and P.H. Bardell, “Random pattern testability”, IEEE Trans. Comput., vol.C-33, pp. 79–90, Jan. 1984.CrossRefGoogle Scholar
  10. [10]
    T.W. Williams, “VLSI testing”, Computer, vol.17, pp. 126–136, Oct. 1984.CrossRefGoogle Scholar
  11. [11]
    W. Shen and A.Y. Oruc, “Mapping algebraic formulas onto mesh-connected processor arrays,” Proc. 20th Ann. Conf. Info. Sci. & Syst., Princeton, NJ, Mar. 1986.Google Scholar

Copyright information

© Springer Science+Business Media New York 1990

Authors and Affiliations

  • Andrzej Rucinski
    • 1
  • Weicheng Shen
    • 1
  1. 1.Dept. of Electrical and Computer EngineeringUniversity of New HampshireDurhamUSA

Personalised recommendations