Mapping Uniform Recurrences Onto Small Size Arrays
(1991) Lecture Notes in Computer Science — Vol. 505, p. 191-208 (1991)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 959.78 KB
Details
- Authors
- Abstract
- Given a regular application described by a system of uniform recurrence equations, systolic arrays are commonly derived by means of an affine transformation; an affine schedule determines when the computations are performed and an affine processor allocation where they are performed. Circuit transformations are then applied on the resulting circuit when the application needs to be mapped onto a smaller size array. This method is in two steps and thus can hardly be optimized globally. We hereafter present a different method for designing small size arrays. We derive them in one step by means of an affine schedule and a near-affine processor allocation. By doing so, we can generalize the optimization technique for affine mapping to be applicable here. The method is illustrated on the band-matrix multiplication and on the convolution algorithms.
- Affiliations
Citations
Vandongen, V. (1991). Mapping Uniform Recurrences Onto Small Size Arrays. Lecture Notes in Computer Science, 505, 191-208. https://doi.org/10.1007/BFb0035105 (Original work published 1991)