Alain Darte, Robert Schreiber, B. Ramakrishna Rau, Frederic Vivien
Constructing and exploiting linear schedules with prescribed parallelism
Laboratoire de l'Informatique du Paralllisme (2007)
Unit Mixte, Arnaud Legr, Helene Renard, ...
Load-balancing iterative computations in heterogeneous clusters with shared communication links Arnaud Legrand,
Data redistribution algorithms (2007)
Thme Num, Hlne Renard, Frdric Vivien, Helene Renard, Yves Robert, Yves Robert, ...
de recherche
Unit Mixte, Helene Renard, Helene Renard, ...
Static load-balancing techniques for iterative computations on heterogeneous clusters
Theme 1--- Reseaux et systemes (2007)
Helene Renard, Helene Renard, Yves Robert, Yves Robert, Frederic Vivien, Frederic Vivien, ...
apport de recherche
Data redistribution algorithms for homogeneous and heterogeneous processor rings (2007)
Helene Renard, Yves Robert, Frederic Vivien
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor rings. The problem arises in several applications, each time after a load-balancing mechanism is...
Pierre Boulet, Jack Dongarra, Yves Robert, Frederic Vivien
In the framework of fully permutable loops, tiling has been extensively studied as a sourceto-source program transformation. However, little work has been devoted to the mapping and scheduling of the...
Scheduling tasks sharing les on heterogeneous clusters (2007)
Frederic Vivien, Arnaud Giersch, Arnaud Giersch, Yves Robert, Yves Robert, Projet Remap
apport de recherche
Helene Renard, Helene Renard, Yves Robert, Yves Robert, Frederic Vivien, ...
for heterogeneous processor rings
ISRN INRIA/RR--4976--FR+ENG (2007)
Frederic Vivien, Arnaud Giersch, Arnaud Giersch, Yves Robert, Yves Robert, Projet Remap
apport de recherche
Laboratoire de l'Informatique du Paralllisme (2007)
Unit Mixte, Arnaud Legr, Helene Renard, ...
Load-balancing iterative computations in heterogeneous clusters with shared communication links Arnaud Legrand,
Pierre Boulet, Jack Dongarra, Yves Robert, Frederic Vivien
This paper discusses some algorithmic issues when computing with a heterogeneous network of workstations (the typical poor man's parallel computer). Dealing with processors of dierent speeds...
Minimal enclosing parallelepiped in 3d (2007)
Frederic Vivien, Frdric Vivien, Nicolas Wicker, Nicolas Wicker, Projet Remap
apport de recherche
Revisiting Matrix Product on Master-Worker Platforms (2006)
Dongarra, Jack, Pineau, Jean-Francois, Robert, Yves, Shi, Zhiao, Vivien, Frederic
This paper is aimed at designing efficient parallel matrix-product algorithms for heterogeneous master-worker platforms. While matrix-product is well-understood for homogeneous 2D-arrays of...
Off-Line Scheduling of Divisible Requests on a Heterogeneous Collection of Databanks (2005)
Arnaud Legrand, Alan Su, Frederic Vivien
In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. We experimentally show that this problem lies in the divisible load framework with negligible...
Scheduling tasks sharing files from distributed repositories (2004)
Frdric Vivien, Arnaud Giersch, Arnaud Giersch, Yves Robert, Yves Robert, Frederic Vivien, ...
apport de recherche
Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks (2004)
École Normale, Supérieure Lyon, Unité Mixte, Alan Su, Frederic Vivien, ...
In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. We show that this problem lies in the divisible load framework. In this framework, we propose...
Load-balancing scatter operations for grid computing (2003)
Stephane Genaud, Frederic Vivien, Stphane Genaud, Arnaud Giersch, Arnaud Giersch, Frdric Vivien, ...
apport de recherche
Load-Balancing Iterative Computations In Heterogeneous Clusters With . . . (2003)
Arnaud Legr, Helene Renard, Helene Renard, Yves Robert, Yves Robert, ...
This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration,...
Scheduling Tasks Sharing Files on Heterogeneous Clusters (2003)
Arnaud Giersch, Yves Robert, Frederic Vivien
This paper is devoted to scheduling a large collection of independent tasks onto heterogeneous clusters. The tasks depend upon (input) files which initially reside on a master processor. A given file...
Constructing and exploiting linear schedules with prescribed parallelism (2002)
Frederic Vivien, Alain Darte, Alain Darte, Robert Schreiber, Robert Schreiber, B. Ramakrishna Rau, ...
systolic array, multicluster VLIW, linear schedule We present two new results of importance in code generation for and synthesis of synchronously scheduled parallel processor arrays and multicluster...
A Unified Framework for Schedule and Storage Optimization (2001)
William Thies, Frederic Vivien, Saman Amarasinghe
We present a unified mathematical framework for analyzing the tradeo#s between parallelism and storage allocation within a parallelizing compiler. Using this framework, we show how to find a good...
A Unified Framework for Schedule and Storage Optimization (2001)
William Thies, Frederic Vivien, Jerey Sheldon, Saman Amarasinghe
We present a unified mathematical framework for analyzing the tradeo#s between parallelism and storage allocation within a parallelizing compiler. Using this framework, we show how to find a good...
Loop parallelization algorithms: From parallelism extraction to code generation (1998)
Pierre Boulet, Alain Darte, Georges-andre Silber, Frederic Vivien
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations they use, the loop transformations they generate, the code generation schemes they require, and...
Tiling for heterogeneous computing platforms (1997)
Pierre Boulet, Pierre Boulet, Jack Dongarra, Jack Dongarra, Yves Robert, Yves Robert, ...
In the framework of fully permutable loops, tiling has been extensively studied as a source-to-source program transformation. However, little work has been devoted to the mapping and scheduling of...
Plugging Anti and Output Dependence Removal Techniques into Loop Parallelization Algorithms (1997)
Pierre-yves Calland, Alain Darte, Yves Robert, Frederic Vivien, Eric Vivien
. In this paper we shortly survey some loop transformation techniques which break anti or output dependences, or artificial cycles involving such "false" dependences. These false...
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs (1997)
This paper presents an optimal algorithm for detecting fine or medium grain parallelism in nested loops whose dependences are described by an approximation of distance vectors by polyhedra. In...
Plugging Anti and Output Dependence Removal Techniques into Loop Parallelization Algorithms (1997)
Pierre-yves Calland, Alain Darte, Yves Robert, Frederic Vivien
this paper we shortly survey some loop transformation techniques which break anti or output dependences, or artificial cycles involving such "false" dependences. These false dependences are...
On the removal of anti and output dependences (1996)
Ecole Normale, Supérieure Lyon, Alain Darte, Yves Robert, Frederic Vivien, Pierre-yves Calland, ...
Unité de recherche associée au CNRS n°1398 On the removal of anti and output dependences
for loop parallelization and loop tiling (1996)
Alain Darte, Georges-andre Silber, Frederic Vivien, Alain Darte, Georges-andre Silber, Frederic Vivien
Unité de recherche associée au CNRS n°1398 Combining retiming and scheduling techniques for loop parallelization and loop tiling
for parallelism extraction in nested loops (1996)
Ecole Normale, Supérieure Lyon, Alain Darte, Frederic Vivien, Alain Darte, Frederic Vivien, ...
Unité de recherche associée au CNRS n°1398 On the optimality ofAllenand Kennedy's algorithm for parallelism extraction in nested loops
Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling (1996)
Alain Darte, Georges-Andre Silber, Frederic Vivien, Eric Vivien, Communicated (name Of
Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider...
Laboratoire de l’Informatique du Parallélisme Ecole Normale Supérieure de Lyon (1995)
Pierre-yves Calland, Anne Mignotte, Olivier Peyran, Yves Robert, Frederic Vivien, Retiming Dags, ...
The increasing complexity of digital circuitry makes global design optimization no longer possible: a designer will only consider the critical parts of his circuit. This paper discusses timing...
A comparison of nested loops parallelization algorithms (1995)
Ecole Normale, Supérieure Lyon, Alain Darte, Frederic Vivien, Alain Darte, Frederic Vivien, ...
Unité de recherche associée au CNRS n°1398 A comparison of nested loops parallelization algorithms