A routing algorithm for harvesting multipipeline arrays with small intercell and pipeline delays
P. Koo, Fabrizio Lombardi, Donatella Sciuto · 2002
A novel approach is analyzed for reconfiguring multipipeline arrays from two-dimensional arrays. The proposed approach is fully characterized and the conditions for switching and routing are given. A polynomial time complexity algorithm is proposed for the reconfiguration of multipipeline arrays. It is proved that 100% harvesting is possible using the proposed algorithm while achieving very small intercell and pipeline delays.>