Fault-Tolerant Array Processors Using Single-Track Switches
IEEE Transactions on Computers
On the repair of redundant RAMs
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Minimum fault coverage in memory arrays: a fast algorithm and probabilistic analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the reconfiguration of degradable VLSI/WSI arrays
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
New Architecture and Algorithms for Degradable VLSI/WSI Arrays
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A Run-time Reconfiguration Algorithm for VLSI Arrays
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
An improved reconfiguration algorithm for degradable VLSI/WSI arrays
Journal of Systems Architecture: the EUROMICRO Journal
Reconfiguration Algorithms for Power Efficient VLSI Subarrays with Four-Port Switches
IEEE Transactions on Computers
Integrated Row and Column Rerouting for Reconfiguration of VLSI Arrays with Four-Port Switches
IEEE Transactions on Computers
A temperature-aware virtual submesh allocation scheme for noc-based manycore chips
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On topology reconfiguration for defect-tolerant NoC-based homogeneous manycore systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the reconfiguration algorithm for fault-tolerant VLSI arrays
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient reconfigurable techniques for VLSI arrays with 6-port switches
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An FPGA-based fault-tolerant 2D systolic array for matrix multiplications
Transactions on computational science XIII
Efficient techniques and hardware analysis for mesh-connected processors
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 14.99 |
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 $T$ from the defective host array such that the dimensions of $T$ 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.