The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1986 vol.35)
pp: 1-12
D.I. Moldovan , Department of Electrical Engineering?Systems, University of Southern Califomia
ABSTRACT
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, January 1986, doi:10.1109/TC.1986.1676652
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool