The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—This paper deals with the issue of developing efficient algorithms for reconfiguring two-dimensional VLSI arrays linked by 4-port switches in the presence of faulty processing elements (PEs). The proposed algorithm reroutes the arrays with faults in both row and column directions at the same time. Unlike previous work, the compensation technique to replace the faulty PE is not restricted to the adjacent rows of the excluded row. Instead, we consider the neighbor rows of any faulty PE for compensation purposes. The non-faulty PEs lying in the excluded rows are also effectively utilized to form the maximal target arrays, making the proposed algorithm more efficient both in terms of the percentages of harvest and degradation of VLSI arrays for random and clustered faults. Empirical study shows that the improvement in harvest increases with increasing fault size, and is more notable for maximal square target arrays than for maximal target arrays. Our investigations show that the improvement can be up to 8% and 23% for a 256 x 256 VLSI array with random faults of size 25%, for maximal target arrays and for maximal square target arrays respectively.</p>
Degradable VLSI array, reconfiguration, faulttolerance, algorithm, routing

W. Jigang, X. Wang and T. Srikanthan, "Integrated Row and Column Rerouting for Reconfiguration of VLSI Arrays with Four-Port Switches," in IEEE Transactions on Computers, vol. 56, no. , pp. 1387-1400, 2007.
88 ms
(Ver 3.3 (11022016))