The parallelization of many algorithms can be obtained using space-time transformations which are applied on nested do-loops or on recurrence equations. In this paper, we analyze systems of linear recurrence equations, a generalization of uniform recurrence equations. The first part of the paper describes a method for finding automatically whether such a system can be scheduled by an affine timing function, independent of the size parameter of the algorithm. In the second part, we describe a powerful method that makes it possible to transform linear recurrences into uniform recurrence equations. Both parts rely on results on integral convex polyhedra. Our results are illustrated on the Gauss elimination algorithm and on the Gauss-Jordan diagonalization algorithm. © 1989 Kluwer Academic Publishers.
CITATION STYLE
Quinton, P., & van Dongen, V. (1989). The mapping of linear recurrence equations on regular arrays. Journal of VLSI Signal Processing, 1(2), 95–113. https://doi.org/10.1007/BF02477176
Mendeley helps you to discover research relevant for your work.