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
Integrated Row and Column Rerouting for Reconfiguration of VLSI Arrays with Four-Port Switches
IEEE Transactions on Computers
On the reconfiguration algorithm for fault-tolerant VLSI arrays
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
| Hi-index | 0.00 |
The problem of "harvesting" aims at obtaining the largest possible working array from an original array in which a (possibly high) number of faults are present, typically at the end of production. While complete spares efficiency has been proved to require channel width and interconnection length proportional to the dimensions of the array, techniques previously presented in literature achieved fixed-dimensions for channels and links by accepting low spares efficiency. In the present paper, an approach previously adopted for survival to faults (i.e., to achieve arrays of fixed dimensions with a pre-determined distribution of spares) is extended to the harvesting problem by proving that partitioning the original array into subarray (within a limited set of constraints) leads to effective reconfiguration. Spares efficiency is seen to be quite satisfactory.