Issue No. 06 - June (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.862215
<p><b>Abstract</b>—This paper considers the problem of reconfiguring two-dimensional degradable VLSI/WSI arrays under the constraint of row and column rerouting. The goal of the reconfiguration problem is to derive a fault-free subarray <tmath>$T$</tmath> from the defective host array such that the dimensions of <tmath>$T$</tmath> are larger than some specified minimum. This problem has been shown to be NP-complete under various switching and routing constraints. However, we show that a special case of the reconfiguration problem is optimally solvable in linear time. Using this result, a new fast and efficient reconfiguration algorithm is proposed. Empirical study shows that the new algorithm indeed produces good results in terms of the percentages of harvest and degradation of VLSI/WSI arrays.</p>
Degradable VLSI/WSI arrays, NP-completeness, greedy algorithm, efficient heuristic.
C. P. Low, "An Efficient Reconfiguration Algorithm for Degradable VLSI/WSI Arrays," in IEEE Transactions on Computers, vol. 49, no. , pp. 553-559, 2000.