Name
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. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1109/TC.1986.1676652 | IEEE Trans. Computers |
Keywords | Field | DocType |
algorithm index,fixed size,algorithm partitioning,mapping algorithms,partitioning problem,computational problem,vlsi array,mapping technique,systolic arrays,algorithm transformation,iterative algorithm,large size,mapping algorithm,systolic array | Computational problem,Computer science,Index set,Parallel computing,Algorithm,Computational model,Computer program,Partition (number theory),Very-large-scale integration,Integrated circuit,Arbitrarily large | Journal |
Volume | Issue | ISSN |
35 | 1 | 0018-9340 |
Citations | PageRank | References |
209 | 27.43 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan I. Moldovan | 1 | 2924 | 482.82 |
| Jose A. B. Fortes | 2 | 446 | 52.01 |