A Clustered Failure Model for the Memory Array Reconfiguration Problem

Reconfiguration of memory array using spare rows and spare columns, which has been shown to be a useful technique for yield enhancement of memories, is considered. A clustered failure model that adopts the center-satellite approach of F.J. Meyer and D.K. Pradhan (1989) is proposed and utilized to show that the total number of faulty cells that can be tolerated when clustering occurs is larger than when faults are independent. It is also shown that an optimal solution to the reconfiguration problem can be found in polynomial time for a special case of the clustering model. An efficient approximation algorithm is given for the general case of the probabilistic model assumed. It is shown, through simulation, that the computation time required by this algorithm to repair large arrays containing a significant number of clustered faults is small. >

[1]  Thomas E. Fuja,et al.  Row/Column Replacement for the Control of Hard Defects in Semiconductor RAM's , 1986, IEEE Transactions on Computers.

[2]  Dhiraj K. Pradhan,et al.  Modeling the Effect of Redundancy on Yield and Performance of VLSI Systems , 1987, IEEE Transactions on Computers.

[3]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[4]  C. H. Stapper,et al.  On yield, fault distributions, and clustering of particles , 1986 .

[5]  W. Kent Fuchs,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987 .

[6]  W. Kent Fuchs,et al.  Probabilistic analysis and algorithms for reconfiguration of memory arrays , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Sudhakar M. Reddy,et al.  On the Repair of Redundant RAMs , 1989, 26th ACM/IEEE Design Automation Conference.

[8]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[9]  M. B. Ketchen.  Point defect yield model for wafer scale integration , 1985, IEEE Circuits and Devices Magazine.

[10]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[11]  Kenneth L. Clarkson,et al.  A Modification of the Greedy Algorithm for Vertex Cover , 1983, Inf. Process. Lett..

[12]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[13]  Dhiraj K. Pradhan,et al.  Modeling Defect Spatial Distribution , 1989, IEEE Trans. Computers.

[14]  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.

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

[16]  Douglas M. Blough.  On the reconfiguration of memory arrays containing clustered faults , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.

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

[18]  W. Kent Fuchs,et al.  Diagnosis and Repair of Large Memories: A Critical Review and Recent Results , 1989 .

[19]  William S. Meisel,et al.  Computer-oriented approaches to pattern recognition , 1972 .

[20]  Anton T. Dahbura,et al.  Increased Thoughput for the Testing and Repair of RAM's with Redundancy , 1991, IEEE Trans. Computers.

[21]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..