Optimal cutting design and analysis for fault-tolerant scheme of redundant memories

被引:0
作者
Huang, Chin-Yu [1 ]
Chang, Yung-Ruei [2 ]
Fang, Kuan-Tung [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 30043, Taiwan
[2] Atom Energy Council, Inst Nucl Energy Res, Tao Yuan, Taiwan
关键词
pare cutting approach; spare cutting approach; memory reconfiguration problem; redundant memory; fault-tolerant; RECONFIGURATION; ALGORITHM; REPAIR; RELIABILITY; ALLOCATION; ARRAYS; SYSTEM; RAMS;
D O I
10.1080/00207720903230021
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fault-tolerant design for memory production is beginning to play an important role in increasing the yield rate of manufacturing. To improve the reliability of memory manufacturing, there are many methods that have been proposed. One of the most used technologies is replacing the faulty cells with spare memory interleaved in the memory. Nowadays, laser-cutting technology improves the yield of memories because of the enhancement of the use of spare lines. However, the issue of choosing a cutting location significantly affects the utilisation of spare lines. A bad cutting location can even render it useless. To use spare lines more efficiently, this article proposes two algorithms. The first one is designed to seek out a good cutting location. It corrects some defects of previous algorithms and provides a better approach to finding cutting candidates. In addition, because most heuristic solution-finding algorithms do not work properly under the condition of cutting memory, the second algorithm, called modification of most-repair is proposed to help make the decision as to whether or not a solution exists for the faulty pattern. We can find an optimal solution by combing these two algorithms. The experimental results show that our proposed algorithms increase the reparable percentage of a 1024-by-1024 memory from 55 to 100% and also improve both the reliability of memory manufacturing and the flexibility of spare lines.
引用
收藏
页码:1085 / 1097
页数:13
相关论文
共 39 条
[1]   Matrix codes: Multiple bit upsets tolerant method for SRAM memories [J].
Argyrides, Costas ;
Zarandi, Hamid R. ;
Pradhan, Dhiraj K. .
DFT 2007: 22ND IEEE INTERNATIONAL SYMPOSIUM ON DEFECT AND FAULT-TOLERANCE IN VLSI SYSTEMS, PROCEEDINGS, 2007, :340-348
[2]  
BHAVSAR DK, 1999, P INT TEST C ITC, P311
[3]   Performance evaluation of a reconfiguration-algorithm for memory arrays containing clustered faults [J].
Blough, DM .
IEEE TRANSACTIONS ON RELIABILITY, 1996, 45 (02) :274-284
[4]   A CLUSTERED FAILURE MODEL FOR THE MEMORY ARRAY RECONFIGURATION PROBLEM [J].
BLOUGH, DM ;
PELC, A .
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (05) :518-528
[5]  
CHE W, 1992, IEEE INT WORKSH DEF, P60
[6]   Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms [J].
Chen, H ;
Kanj, IA .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (04) :833-847
[7]   RELIABILITY, RECONFIGURATION, AND SPARE ALLOCATION ISSUES IN BINARY-TREE ARCHITECTURES BASED ON MULTIPLE-LEVEL REDUNDANCY [J].
CHEN, YY ;
UPADHYAYA, SJ .
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (06) :713-723
[8]   Reliability measurement of mass storage system for unboard instrumentation [J].
Choi, M ;
Park, N ;
Piuri, V ;
Lombardi, F .
IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2005, 54 (06) :2297-2304
[9]  
CHOR PL, 2000, IEEE T COMPUT, V49, P553
[10]   An efficient exact algorithm for constraint bipartite vertex cover [J].
Fernau, H ;
Niedermeier, R .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 38 (02) :374-410