The paper is concerned with the uniformization of a system of affine recurrence equations. This transformation is used in the design (or compilation) of highly parallel embedded systems (VLSI systolic arrays, signal processing filters, etc.). We present and implement an automatic system to achieve uniformization of systems of affine recurrence equations. We unify the results from many earlier papers, develop some theoretical extensions, and then propose effective uniformization algorithms. Our results can be used in any high level synthesis tool based on polyhedral representation of nested loop computations
The theory of synthesis for designing regular array architectures has been established for some time...
Executing a program in parallel machines needs not only to find sufficient parallelism in a program,...
Journal ArticleWe present a technique for mapping recurrence equations to systolic arrays. While thi...
This paper is concerned with the uniformization of a system of afine recurrence equations. This tra...
The paper is concerned with the uniformization of a system of affine recurrence equations. This tra...
Given a regular application described by a system of uniform recurrence equations, systolic arrays a...
AbstractMost work on the problem of synthesizing a systolic array from a system of recurrence equati...
Efficient implementation of problems on processor arrays requires dedicated compiling techniques. Th...
This paper adresses the problem of efficient mappings of nested loops, and more generally of system...
Most work on the problem of synthesizing a systolic array from a system of recur-rence equations is ...
This paper presents an algorithm to find the optimal affine partitions that maximize the degree of p...
Linear programming methods, optimizations on polytopes, manipulations of integral matrices, are now ...
We consider a system of uniform recurrence equations of dimension one. We show how the computation c...
International audienceWe consider a system of uniform recurrence equations (URE) of dimension one. W...
This papers presents an approach to statement-level independent partitioning of uniform recurrences,...
The theory of synthesis for designing regular array architectures has been established for some time...
Executing a program in parallel machines needs not only to find sufficient parallelism in a program,...
Journal ArticleWe present a technique for mapping recurrence equations to systolic arrays. While thi...
This paper is concerned with the uniformization of a system of afine recurrence equations. This tra...
The paper is concerned with the uniformization of a system of affine recurrence equations. This tra...
Given a regular application described by a system of uniform recurrence equations, systolic arrays a...
AbstractMost work on the problem of synthesizing a systolic array from a system of recurrence equati...
Efficient implementation of problems on processor arrays requires dedicated compiling techniques. Th...
This paper adresses the problem of efficient mappings of nested loops, and more generally of system...
Most work on the problem of synthesizing a systolic array from a system of recur-rence equations is ...
This paper presents an algorithm to find the optimal affine partitions that maximize the degree of p...
Linear programming methods, optimizations on polytopes, manipulations of integral matrices, are now ...
We consider a system of uniform recurrence equations of dimension one. We show how the computation c...
International audienceWe consider a system of uniform recurrence equations (URE) of dimension one. W...
This papers presents an approach to statement-level independent partitioning of uniform recurrences,...
The theory of synthesis for designing regular array architectures has been established for some time...
Executing a program in parallel machines needs not only to find sufficient parallelism in a program,...
Journal ArticleWe present a technique for mapping recurrence equations to systolic arrays. While thi...