On the reconfiguration algorithm for fault-tolerant VLSI arrays

被引:0
|
作者
Wu, JG [1 ]
Thambipillai, S [1 ]
机构
[1] Nanyang Technol Univ, Ctr High Performance Embedded Syst, Singapore 639798, Singapore
关键词
degradable VLSI array; reconfiguration; fault-tolerance; greedy algorithm; NP-completeness;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, an improved algorithm is presented for the NP-complete problem of reconfiguring a two-dimensional degradable VLSI array under the row and column routing constraints. The proposed algorithm adopts the partial computing for the logical row exclusion so that the most efficient algorithm, cited in literature, is speeded up without loss of performance. In addition, a flaw in the earlier approach is also addressed. Experimental results show that our algorithm is approximately 50% faster than the above stated algorithm.
引用
收藏
页码:360 / 366
页数:7
相关论文
共 50 条