Add to ORKGInternational 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
New mapping algorithms for domain oriented data-parallel computations, where the workload is distrib...
In this thesis we present an optimal time parallel solution to the problem of first order linear rec...
La résolution de grands systèmes linéaires creux est un élément essentiel des simulations numériques...
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...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
AbstractSystems of uniform recurrence equations were proposed by Karp et al. (1967) as a means to de...
This paper investigates the computability of recurrence equations. We first recall the results estab...
Iteration space tiling is a common strategy used by parallelizing compilers and in performance tunin...
AMS subject classification: 68Q22, 90C90We discuss in this paper the problem of generating highly ef...
PhD ThesisThis thesis deals with the methodology and software of automatic parallelisation for nume...
Non-uniform distance loop dependences are a known obstacle to find parallel iterations. To find the ...
Consider an application that consists of n independent identical tasks to be executed on m computers...
AbstractMost work on the problem of synthesizing a systolic array from a system of recurrence equati...
In this paper, the methods of recursive function theory are used to study the size (or cost or compl...
New mapping algorithms for domain oriented data-parallel computations, where the workload is distrib...
In this thesis we present an optimal time parallel solution to the problem of first order linear rec...
La résolution de grands systèmes linéaires creux est un élément essentiel des simulations numériques...
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...
International audienceIn this paper, we address the following problem: given a synchronous digital c...
AbstractSystems of uniform recurrence equations were proposed by Karp et al. (1967) as a means to de...
This paper investigates the computability of recurrence equations. We first recall the results estab...
Iteration space tiling is a common strategy used by parallelizing compilers and in performance tunin...
AMS subject classification: 68Q22, 90C90We discuss in this paper the problem of generating highly ef...
PhD ThesisThis thesis deals with the methodology and software of automatic parallelisation for nume...
Non-uniform distance loop dependences are a known obstacle to find parallel iterations. To find the ...
Consider an application that consists of n independent identical tasks to be executed on m computers...
AbstractMost work on the problem of synthesizing a systolic array from a system of recurrence equati...
In this paper, the methods of recursive function theory are used to study the size (or cost or compl...
New mapping algorithms for domain oriented data-parallel computations, where the workload is distrib...
In this thesis we present an optimal time parallel solution to the problem of first order linear rec...
La résolution de grands systèmes linéaires creux est un élément essentiel des simulations numériques...