Efficient reconfiguration algorithms for degradable VLSI/WSI arrays

The development of efficient algorithms for constructing a flawless subarray from a defective VLSI/WSI (wafer scale integration) array is discussed. The array consists of identical elements such as processors or memory cells embedded in a switch lattice in the form of a rectangular grid, in contrast to the redundancy approach in which some elements are dedicated as spares, all the elements in the degradation approach are treated in a uniform way. Each element can be either fault-free or defective, and a subarray which contains no faulty element is derived under constraints of switching and routing mechanisms. Although extensive literature exists concerning spare allocation and reconfiguration in arrays with redundancy, little research has been published on optimal reconfiguration in a degradable array. A graph formulation is used to describe the problem, and reconfiguration is found to relate to finding an independent set of a graph. Efficient heuristic algorithms are presented to determine a target subarray from the defective host array. >

[1]  Sun-Yuan Kung,et al.  Fault-Tolerant Array Processors Using Single-Track Switches , 1989, IEEE Trans. Computers.

[2]  Edwin H. Rogers,et al.  Architectural yield analysis of random defects in wafer scale integration , 1989, [1989] Proceedings International Conference on Wafer Scale Integration.

[3]  Chin-Long Wey,et al.  On the Repair of Redundant RAM's , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  W. Kent Fuchs,et al.  Spare allocation and reconfiguration in large area VLSI , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[5]  F. G. Gray,et al.  Summary of a distributed control algorithm for a dynamically reconfigurable array architecture , 1989, [1989] Proceedings International Conference on Wafer Scale Integration.

[6]  Mariagiovanna Sami,et al.  A general index mapping technique for array reconfiguration , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[7]  Sy-yen Kuo,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987, IEEE Design & Test of Computers.

[8]  John Day.  A Fault-Driven, Comprehensive Redundancy Algorithm , 1985, IEEE Design & Test of Computers.

[9]  W.R. Moore,et al.  A review of fault-tolerant techniques for the enhancement of integrated circuit yield , 1986, Proceedings of the IEEE.

[10]  Fabrizio Lombardi,et al.  Approaches for the repair of VLSI/WSI RRAMs by row/column deletion , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[11]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.

[12]  Frank Thomson Leighton,et al.  Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.

[13]  Renato Stefanelli,et al.  Reconfigurable architectures for VLSI processing arrays , 1986 .

[14]  L. LaForge,et al.  Extremally fault tolerant arrays , 1989, [1989] Proceedings International Conference on Wafer Scale Integration.

[15]  Nany Hasan,et al.  Minimum fault coverage in reconfigurable arrays , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[16]  T.E. Mangir.  Sources of failures and yield improvement for VLSI and restructurable interconnects for RVLSI and WSI: Part II—Restructurable interconnects for RVLSI and WSI , 1984, Proceedings of the IEEE.