This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1986 (vol. 35 no. 1)
pp. 1-12
D.I. Moldovan, Department of Electrical Engineering?Systems, University of Southern Califomia
A technique for partitioning and mapping algorithms into VLSI systolic arrays is presented in this paper. Algorithm partitioning is essential when the size of a computational problem is larger than the size of the VLSI array intended for that problem. Computational models are introduced for systolic arrays and iterative algorithms. First, we discuss the mapping of algorithms into arbitrarily large size VLSI arrays. This mapping is based on the idea of algorithm transformations. Then, we present an approach to algorithm partitioning which is also based on algorithm transformations. Our approach to the partitioning problem is to divide the algorithm index set into bands and to map these bands into the processor space. The partitioning and mapping technique developed throughout the paper is summarized as a six step procedure. A computer program implementing this procedure was developed and some results obtained with this program are presented.
Index Terms:
VLSI architectures, Algorithm models, algorithm partitioning, algorithm transformations, VLSI algorithms
Citation:
D.I. Moldovan, J.A.B. Fortes, "Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays," IEEE Transactions on Computers, vol. 35, no. 1, pp. 1-12, Jan. 1986, doi:10.1109/TC.1986.1676652
Usage of this product signifies your acceptance of the Terms of Use.