International audienceWe consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous processors. This result is then applied to register minimization for digital circuits and parallel computation of task graphs
AbstractA restructuring transformation is described which can be used to parallelize recurrence rela...
In this article, we present a technique that allows us to generate parallel tiled code to calculate ...
Given a regular application described by a system of uniform recurrence equations, systolic arrays a...
International audienceWe consider a system of uniform recurrence equations (URE) of dimension one. W...
We consider a system of uniform recurrence equations of dimension one. We show how the computation c...
This paper investigates the computability of recurrence equations. We first recall the results estab...
In this thesis we present an optimal time parallel solution to the problem of first order linear rec...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
The paper is concerned with the uniformization of a system of affine recurrence equations. This tra...
This paper is concerned with the uniformization of a system of afine recurrence equations. This tra...
AbstractSystems of uniform recurrence equations were proposed by Karp et al. (1967) as a means to de...
AbstractMost work on the problem of synthesizing a systolic array from a system of recurrence equati...
This paper adresses the problem of efficient mappings of nested loops, and more generally of system...
Iteration space tiling is a common strategy used by parallelizing compilers and in performance tunin...
AbstractA restructuring transformation is described which can be used to parallelize recurrence rela...
In this article, we present a technique that allows us to generate parallel tiled code to calculate ...
Given a regular application described by a system of uniform recurrence equations, systolic arrays a...
International audienceWe consider a system of uniform recurrence equations (URE) of dimension one. W...
We consider a system of uniform recurrence equations of dimension one. We show how the computation c...
This paper investigates the computability of recurrence equations. We first recall the results estab...
In this thesis we present an optimal time parallel solution to the problem of first order linear rec...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
The paper is concerned with the uniformization of a system of affine recurrence equations. This tra...
This paper is concerned with the uniformization of a system of afine recurrence equations. This tra...
AbstractSystems of uniform recurrence equations were proposed by Karp et al. (1967) as a means to de...
AbstractMost work on the problem of synthesizing a systolic array from a system of recurrence equati...
This paper adresses the problem of efficient mappings of nested loops, and more generally of system...
Iteration space tiling is a common strategy used by parallelizing compilers and in performance tunin...
AbstractA restructuring transformation is described which can be used to parallelize recurrence rela...
In this article, we present a technique that allows us to generate parallel tiled code to calculate ...
Given a regular application described by a system of uniform recurrence equations, systolic arrays a...