On the complexity of testing for catastrophic faults
In this paper, the problem of determining a fault pattern to be catastrophic for unidirectional linear array with k- link redundancy is studied. First, we establish a necessary and sufficient condition for a fault pattern to be catastrophic. Based on this necessary and sufficient condition, we derive an efficient testing algorithm whose complexity is O(mk), where k is the number of bypass links, and m is the number of faults. This testing scheme, which improves the existing O(mk log k) bound, is based on a novel “geometric” approach.
Unable to display preview. Download preview PDF.
- 1.Apostolico, A., Atallah, M. J., Larmore, L. and McFaddin, H. S., “Efficient Parallel Algorithms for String Editing and Related Problems,” SIAM J. Comput., Vol. 19, 1990, pp. 968–998.Google Scholar
- 2.De Prisco, R. and Monti, A., “On Reconfigurability of VLSI Linear Arrays,” in Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science No. 709, Springer-Verlag, 1993, pp. 553–564.Google Scholar
- 3.De Prisco, R. and De Santis, A., “Catastrophic Fault Patterns for a VLSI Linear Array with Unidirectional Bypass Links,” Internal Report, Dipartimento di Informatica, Università di Salerno, Italy, 1992.Google Scholar
- 4.Koren, I. and Pradhan, D. K., “Introducing Redundancy into VLSI Designs for Yield and Performance Enhancement,” in Proc. 15th Int'l Conf. on Fault-Tolerant Computers, 1985, pp. 330–335.Google Scholar
- 5.Li, H. F., Jayakumar, R. and Lam, C., “Restructuring for Fault-Tolerant Systolic Arrays,” IEEE Trans. on Computers, Vol. C-38, No. 2, 1989, pp. 307–311.Google Scholar
- 6.Nayak, A., Pagli, L. and Santoro, N., “Recognition of Catastrophic Faults,” in Proc. Int'l Workshop on Defect and Fault Tolerance in VLSI Systems, Dallas, 1992, pp. 70–79.Google Scholar
- 7.Nayak, A., Pagli, L. and Santoro, N., “Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays”, Integration — the VLSI journal, Vol. 15, No. 2, Oct. 1993, pp. 133–150.Google Scholar
- 8.Nayak, A., Pagli, L. and Santoro, N., “Combinatorial and Graph Problems arising in the Analysis of Catastrophic Fault Patterns,” in Proc. 23rd Southeastern Int'l Conf. on Combinatorics, Graph Theory, and Computing; Congressus Numerantium 88 (Utilitas Mathematica), 1992, pp. 7–20.Google Scholar
- 9.Nayak, A., Santoro, N. and Tan, R., “Fault-Intolerance of Reconfigurable Systolic Arrays,” in Proc. 20th Int'l Symp. on Fault-Tolerant Computers, Newcastle upon Tyne, 1990, pp. 202–209.Google Scholar
- 10.Pagli, L. and Pucci, G., “Reliability Analysis of Redundant VLSI Arrays,” Information Processing Letters, 50(1994), pp. 337–342.Google Scholar
- 11.Ren, J., “Geometric Characterization of Fault Patterns in Linear Systolic Arrays,” M.C.S. Thesis, School of Computer Science, Carleton University, Canada, 1994.Google Scholar
- 12.Sipala, P., “Faults in Linear Arrays with Multiple Bypass Links,” Research Report No. 18, Dipartimento di Informatica, Università Degli Studi di Trieste, Italy, 1993.Google Scholar