Parallel Processing Symposium, International (1991)
Anaheim, CA, USA
Apr. 30, 1991 to May 2, 1991
Mongenet , Dept. d'Inf., Univ. Louis Pasteur, Strasbourg, France
The paper is devoted to the problem of mapping algorithms onto regular and synchronous processor arrays. The authors consider problems which are defined by Systems of Affine Recurrence Equations. From such statements, a geometrical coding is proposed to express the data dependencies in terms of two classes of vectors: the generating vectors and the inductive vectors. These vectors are used to implement constraints on the timing or the allocation functions. The authors differentiate two classes of constraints: the causal ones induced by the system of equations and the architecture-related ones. These constraints are taken into account to compile affine timing functions and allocations by projection. The authors illustrate these tools with the examples of the Gaussian elimination and the recursive convolution.
parallel algorithms, compilers, affine recurrence equations, regular arrays, mapping algorithms, synchronous processor arrays, data dependencies, Gaussian elimination, recursive convolution
Perrin, Clauss and Mongenet, "A geometrical coding to compile affine recurrence equations on regular arrays," Parallel Processing Symposium, International(IPPS), Anaheim, CA, USA, 1991, pp. 582-590.