DocumentCode :
3548736
Title :
On the reconfiguration of memory arrays containing clustered faults
Author :
Blough, D.M.
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA
fYear :
1991
fDate :
25-27 June 1991
Firstpage :
444
Lastpage :
451
Abstract :
Reconfiguration of memory arrays using spare rows and spare columns, a useful technique for yield enhancement of memories, is considered under a compound probabilistic model that shows clustering of faults. It is shown that the total number of faulty cells that can be tolerated when clustering occurs is larger than when faults are independent. It is shown that an optimal solution to the reconfiguration problem can be found in polynomial time for a special case of the clustering model. Efficient approximation algorithms are given for the situation in which faults appear in clusters only and the situation in which faults occur both in clusters and singly. 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.<>
Keywords :
memory architecture; storage management; approximation algorithms; clustered faults; clustering; compound probabilistic model; computation time; memory arrays reconfiguration; simulation; spare columns; spare rows; yield enhancement; Algorithm design and analysis; Approximation algorithms; Clustering algorithms; Computational modeling; Decoding; Manufacturing; Polynomials; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fault-Tolerant Computing, 1991. FTCS-21. Digest of Papers., Twenty-First International Symposium
Conference_Location :
Montreal, Quebec, Canada
Print_ISBN :
0-8186-2150-8
Type :
conf
DOI :
10.1109/FTCS.1991.146699
Filename :
146699
Link To Document :
بازگشت