DocumentCode
2979932
Title
A routing algorithm for harvesting multipipeline arrays with small intercell and pipeline delays
Author
Koo, P. ; Lombardi, F. ; Sciuto, D.
Author_Institution
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
fYear
1990
fDate
11-15 Nov. 1990
Firstpage
2
Lastpage
5
Abstract
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.<>
Keywords
circuit layout CAD; computational complexity; delays; intercell; multipipeline arrays; pipeline delays; polynomial time complexity; routing algorithm; two-dimensional arrays; Array signal processing; Circuit faults; Computer architecture; Computer science; Delay; Pipelines; Polynomials; Routing; Switches; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-2055-2
Type
conf
DOI
10.1109/ICCAD.1990.129824
Filename
129824
Link To Document