Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
Dans cet article, nous considérons l'allocation dynamique (online) d'un très grand nombre de tâches identiques et indépendantes sur une plate-forme maîtres-esclaves. Initialement, plusieurs...
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of the online allocation of a very large number of identical tasks on a master-slave platform. Initially, several masters hold or generate tasks that are...
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
Dans cet article, nous considérons l'allocation dynamique (online) d'un très grand nombre de tâches identiques et indépendantes sur une plate-forme maîtres-esclaves. Initialement, plusieurs...
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of the online allocation of a very large number of identical tasks on a master-slave platform. Initially, several masters hold or generate tasks that are...
Rejeb, Hejer, Beaumont, Olivier
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. In this model, each...
Rejeb, Hejer, Beaumont, Olivier
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. In this model, each...
Rejeb, Hejer, Beaumont, Olivier
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. In this model, each...
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
Dans cet article, nous considérons l'allocation dynamique (online) d'un très grand nombre de tâches identiques et indépendantes sur une plate-forme maîtres-esclaves. Initialement, plusieurs...
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of the online allocation of a very large number of identical tasks on a master-slave platform. Initially, several masters hold or generate tasks that are...
Rejeb, Hejer, Beaumont, Olivier
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. In this model, each...
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
Dans cet article, nous considérons l'allocation dynamique (online) d'un très grand nombre de tâches identiques et indépendantes sur une plate-forme maîtres-esclaves. Initialement, plusieurs...
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of the online allocation of a very large number of identical tasks on a master-slave platform. Initially, several masters hold or generate tasks that are...
Evolution of parallel machines (2008)
Yves Robert, École Normale, Supérieure Lyon, Larry Carter, Henri Casanova, Jeanne Ferrante, ...
Evolution of parallel machines... and soon to the Holy Grid? Parallel algorithm design and scheduling were already difficult tasks with homogeneous machines Yves Robert Scheduling for Heterogeneous...
Olivier Beaumont, Arnaud Legr, Fabrice Rastello, Yves Robert, Olivier Beaumont, Arnaud Legrand, ...
In this paper, the authors deal with algorithmic issues on heterogeneous platforms. They concentrate on dense linear algebra kernels, such as matrix multiplication or LU decomposition. Block-cyclic...
Laboratoire de l’Informatique du Parallélisme (2008)
École Normale, Supérieure Lyon, Unité Mixte, Olivier Beaumont, Loris Marchal, ...
Scheduling divisible loads with return messages on heterogeneous master-worker platforms
Olivier Beaumont, Anne-marie Kermarrec, Étienne Rivière, Thème Com, Olivier Beaumont, Anne-marie Kermarrec, ...
apport de recherche
Heterogenous dating service with application to rumor spreading (2008)
Beaumont, Olivier, Duchon, Philippe, Korzeniowski, Miroslaw
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the...
Heterogenous dating service with application to rumor spreading (2008)
Beaumont, Olivier, Duchon, Philippe, Korzeniowski, Miroslaw
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the...
Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms (2008)
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous large scale computing platforms, such as BOINC~\cite{boinc} or...
Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms (2008)
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous large scale computing platforms, such as BOINC~\cite{boinc} or...
A Distributed Algorithm for Resource Clustering in Large Scale Platforms (2008)
Beaumont, Olivier, Bonichon, Nicolas, Duchon, Philippe, Eyraud-Dubois, Lionel, Larchevêque, Hubert
We consider the resource clustering problem in large scale distributed platforms, such as BOINC, WCG or Folding@home. In this context, applications mostly consist in a huge set of independent tasks,...
A Distributed Algorithm for Resource Clustering in Large Scale Platforms (2008)
Beaumont, Olivier, Bonichon, Nicolas, Duchon, Philippe, Eyraud-Dubois, Lionel, Larchevêque, Hubert
We consider the resource clustering problem in large scale distributed platforms, such as BOINC, WCG or Folding@home. In this context, applications mostly consist in a huge set of independent tasks,...
GHATPANDE, Abhay, NAKAZATO, Hidenori, BEAUMONT, Olivier, WATANABE, Hiroshi
Divisible Load Theory (DLT) is an established mathematical framework to study Divisible Load Scheduling (DLS). However, traditional DLT does not address the scheduling of results back to source...
Analysis of Divisible Load Scheduling with Result Collection on Heterogeneous Systems (2008)
GHATPANDE, Abhay, NAKAZATO, Hidenori, BEAUMONT, Olivier, WATANABE, Hiroshi
Divisible Load Theory (DLT) is an established framework to study Divisible Load Scheduling (DLS). Traditional DLT ignores the result collection phase, and specifies no solution to the general case...
A Distributed Algorithm for Resource Clustering in Large Scale Platforms (2008)
Beaumont, Olivier, Bonichon, Nicolas, Duchon, Philippe, Eyraud-Dubois, Lionel, Larchevêque, Hubert
We consider the resource clustering problem in large scale distributed platforms, such as BOINC, WCG or Folding@home. In this context, applications mostly consist in a huge set of independent tasks,...
Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms (2008)
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous large scale computing platforms, such as BOINC~\cite{boinc} or...
Heterogenous dating service with application to rumor spreading (2008)
Beaumont, Olivier, Duchon, Philippe, Korzeniowski, Miroslaw
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the...
A Distributed Algorithm for Resource Clustering in Large Scale Platforms (2008)
Beaumont, Olivier, Bonichon, Nicolas, Duchon, Philippe, Eyraud-Dubois, Lionel, Larchevêque, Hubert
We consider the resource clustering problem in large scale distributed platforms, such as BOINC, WCG or Folding@home. In this context, applications mostly consist in a huge set of independent tasks,...
Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms (2008)
Beaumont, Olivier, Eyraud-Dubois, Lionel, Rejeb, Hejer, Thraves, Christopher
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous large scale computing platforms, such as BOINC~\cite{boinc} or...
Heterogenous dating service with application to rumor spreading (2008)
Beaumont, Olivier, Duchon, Philippe, Korzeniowski, Miroslaw
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the...
Laboratoire de l'Informatique du Paralllisme (2007)
Unit Mixte, Olivier Beaumont, Olivier Beaumont, ...
A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs
J. Parallel and Distributed Computing, 2001, paratre. (2007)
Christophe Barberet, Lionel Brunie, Frdric Desprez, Gilles Lebourgeois, Raymond Namyst, Stphane Ubeda, ...
[74] Pierre Boulet, Jack Dongarra, Yves Robert, and Frdric Vivien. Static tiling for heterogeneous computing
A Realistic Model and an Ecient Heuristic (2007)
Unit Mixte, Vincent Boudet, Olivier Beaumont, ...
Scheduling computational tasks on processors is a key issue for highperformance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target...
Peer to peer multidimensional overlays: Approximating complex structures (2007)
Beaumont, Olivier, Kermarrec, Anne-Marie, Rivière, Étienne
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the...
Peer to peer multidimensional overlays: Approximating complex structures (2007)
Beaumont, Olivier, Kermarrec, Anne-Marie, Rivière, Étienne
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the...
Heterogenous dating service with application to rumor spreading (2007)
Beaumont, Olivier, Duchon, Philippe, Korzeniowski, Miroslaw
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the...
Heterogenous dating service with application to rumor spreading (2007)
Beaumont, Olivier, Duchon, Philippe, Korzeniowski, Miroslaw
In this paper, we describe a fully decentralized algorithm, called "dating service" to organize communications into a fully heterogeneous network, that ensures that communication capabilities of the...
Peer to peer multidimensional overlays: Approximating complex structures (2007)
Beaumont, Olivier, Kermarrec, Anne-Marie, Rivière, Etienne
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the...
Peer to peer multidimensional overlays: Approximating complex structures (2007)
Beaumont, Olivier, Kermarrec, Anne-Marie, Rivière, Étienne
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the...
Olivier Beaumont, Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ralf Klasing, Nicolas Bonichon, ...
– Loris Marchal, PhD, co-superv. ENS Lyon, def. 10/06 – Nelson Morales, PhD, co-superv. INRIA Sophia, def. 01/07 1
VoroNet: A scalable object network based on voronoi tessellations (2007)
Olivier Beaumont, Anne-marie Kermarrec, Loris Marchal, Étienne Rivière, Ens Lyon
In this paper, we propose the design of VoroNet, an objectbased peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation. VoroNet...
Peer to peer multidimensional overlays: Approximating complex structures (2007)
Beaumont, Olivier, Kermarrec, Anne-Marie, Rivière, Etienne
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the...
Peer to peer multidimensional overlays: Approximating complex structures (2007)
Beaumont, Olivier, Kermarrec, Anne-Marie, Rivière, Etienne
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the...
VoroNet: A scalable object network based on Voronoi tessellations (2006)
Beaumont, Olivier, Kermarrec, Anne-Marie, Marchal, Loris, Rivière, Etienne
In this paper, we propose the design of VoroNet, an object-based peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation....
VoroNet : a scalable object network based on Voronoi tessellations (2006)
Beaumont, Olivier, Kermarrec, Anne-Marie, Marchal, Loris, Rivière, Etienne
23 pages, graphiques, figures, 13 références bibliographiques
VoroNet: A scalable object network based on Voronoi tessellations (2006)
Beaumont, Olivier, Kermarrec, Anne-Marie, Marchal, Loris, Rivière, Etienne
In this paper, we propose the design of VoroNet, an object-based peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation....
VoroNet: A scalable object network based on Voronoi tessellations (2006)
Beaumont, Olivier, Kermarrec, Anne-Marie, Marchal, Loris, Rivière, Etienne
In this paper, we propose the design of VoroNet, an object-based peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation....
Master-slave tasking on asymmetric networks (2006)
Cyril Banino-rokkones, Olivier Beaumont, Lasse Natvig
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of independent,...
Centralized Versus Distributed Schedulers (2006)
Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legr, Loris Marchal, ...
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and...
VoroNet: A scalable object network based on Voronoi tessellations (2006)
École Normale, Supérieure Lyon, Olivier Beaumont, Anne-marie Kermarrec, Loris Marchal, Etienne Rivière, ...
VoroNet: A scalable object network based on Voronoi tessellations
VoroNet: A scalable object network based on Voronoi tessellations (2006)
Beaumont, Olivier, Kermarrec, Anne-Marie, Marchal, Loris, Rivière, Etienne
In this paper, we propose the design of VoroNet, an object-based peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation....
VoroNet: A scalable object network based on Voronoi tessellations (2006)
Beaumont, Olivier, Kermarrec, Anne-Marie, Marchal, Loris, Rivière, Etienne
In this paper, we propose the design of VoroNet, an object-based peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation....
FIFO scheduling of divisible loads with return messages under the one-port model (2005)
Beaumont, Olivier, Marchal, Loris, Rehn, Veronika, Robert, Yves
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of , where the same problem was considered under the 2-port...
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Marchal, Loris, Robert, Yves
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and...
Scheduling divisible loads with return messages on heterogeneous master-worker platforms (2005)
Beaumont, Olivier, Marchal, Loris, Robert, Yves
21 p., figures, graphiques, 25 références bibliographiques.
FIFO scheduling of divisible loads with return messages under the one-port model (2005)
Beaumont, Olivier, Marchal, Loris, Rehn, Veronika, Robert, Yves
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of , where the same problem was considered under the 2-port...
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Marchal, Loris, Robert, Yves
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and...
FIFO scheduling of divisible loads with return messages under the one-port model (2005)
Beaumont, Olivier, Marchal, Loris, Rehn, Veronika, Robert, Yves
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of , where the same problem was considered under the 2-port...
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Marchal, Loris, Robert, Yves
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and...
Olivier Beaumont, Loris Marchal, (2005)
École Normale, Supérieure Lyon, Unité Mixte, Veronika Rehn, Yves Robert, ...
FIFO scheduling of divisible loads with return messages under the one-port model
École Normale, Supérieure Lyon, Unité Mixte, Larry Carter, Jeanne Ferrante, ...
Scheduling multiple bags of tasks on heterogeneous master-worker platforms: centralized versus distributed solutions
Broadcast trees for heterogeneous platforms (2005)
Olivier Beaumont, Loris Marchal, Yves Robert, Olivier Beaumont, Loris Marchal, Yves Robert
Laboratoire de l'Informatique du Paralle'lisme E'cole Normale Supe'rieure de LyonUnite ' Mixte de Recherche CNRS-INRIA-ENS LYON-UCBL no 5668
FIFO scheduling of divisible loads with return messages under the one-port model (2005)
Beaumont, Olivier, Marchal, Loris, Rehn, Veronika, Robert, Yves
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of , where the same problem was considered under the 2-port...
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Marchal, Loris, Robert, Yves
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and...
FIFO scheduling of divisible loads with return messages under the one-port model (2005)
Beaumont, Olivier, Marchal, Loris, Rehn, Veronika, Robert, Yves
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of , where the same problem was considered under the 2-port...
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Marchal, Loris, Robert, Yves
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and...
Broadcast Trees for Heterogeneous Platforms. (2004)
Beaumont, Olivier, Marchal, Loris, Robert, Yves
(eng) In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline...
Pipelining Broadcasts on Heterogeneous Platforms under the One-Port Model. (2004)
Beaumont, Olivier, Marchal, Loris
(eng) In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-communication...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider steady-state scheduling techniques for mapping a collection of application graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
(eng) In this paper, we consider steady-state scheduling techniques for mapping a collection of application graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
(eng) In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for...
Steady-State Scheduling on Heterogeneous Clusters: Why and How?. (2004)
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
(eng) In this paper, we consider steady-state scheduling techniques for heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to solve a variety of...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris
In this paper, we consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes,...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
(eng) In this paper, we consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider steady-state scheduling techniques for mapping a collection of application graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes,...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider steady-state scheduling techniques for mapping a collection of application graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes,...
Olivier Beaumont, Arnaud Legrand, (2004)
École Normale, Supérieure Lyon, Unité Mixte, Loris Marchal, Yves Robert, ...
Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms
Steady-State Scheduling on Heterogeneous Clusters: Why and How? (2004)
École Normale, Supérieure Lyon, Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert, ...
In this paper, we consider steady-state scheduling techniques for heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to solve a variety of important...
Broadcast Trees for Heterogeneous Platforms (2004)
École Normale, Supérieure Lyon, Olivier Beaumont, Loris Marchal, Yves Robert, École Normale, ...
In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion....
École Normale, Supérieure Lyon, Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert, ...
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous starshaped platforms. We also address the same problem for...
Pipelining Broadcasts on Heterogeneous Platforms under the One-Port Model (2004)
École Normale, Supérieure Lyon, Olivier Beaumont, Loris Marchal, École Normale, Supérieure Lyon, ...
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes,...
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms (2004)
Cyril Banino, Olivier Beaumont, Larry Carter, Jeanne Ferrante, Senior Member, Arnaud Legrand, ...
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous computing platform. We use a nonoriented graph to model the platform, where...
Olivier Beaumont, Arnaud Legrand, (2004)
École Normale, Supérieure Lyon, Unité Mixte, Loris Marchal, Yves Robert, ...
Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes,...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider steady-state scheduling techniques for mapping a collection of application graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes,...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for...
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider steady-state scheduling techniques for mapping a collection of application graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of...
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems. (2003)
Beaumont, Olivier, Casanova, Henri, Legrand, Arnaud, Robert, Yves, Yang Yang
(eng) Applications in many scientific and engineering domains are structured in large numbers of independent tasks with low granularity. These applications can thus be naturally parallelized,...
Steady-state scheduling of task graphs on heterogeneous computing platforms (2003)
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be...
Optimizing the steady-state throughput of Broadcasts on heterogeneous platforms (2003)
Legrand, Arnaud, Beaumont, Olivier, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous «grid» platform. Such applications extensively use macro-communication...
Steady-state scheduling of task graphs on heterogeneous computing platforms. (2003)
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
(eng) In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to...
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems (2003)
Beaumont, Olivier, Casanova, Henri, Legrand, Arnaud, Robert, Yves, Yang, Yang
Applications in many scientific and engineering domains are structured in large numbers of independent tasks with low granularity. These applications can thus be naturally parallelized, typically in...
Steady-state scheduling of task graphs on heterogeneous computing platforms (2003)
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be...
Optimizing the steady-state throughput of Broadcasts on heterogeneous platforms (2003)
Legrand, Arnaud, Beaumont, Olivier, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous «grid» platform. Such applications extensively use macro-communication...
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems (2003)
Beaumont, Olivier, Casanova, Henri, Legrand, Arnaud, Robert, Yves, Yang, Yang
Applications in many scientific and engineering domains are structured in large numbers of independent tasks with low granularity. These applications can thus be naturally parallelized, typically in...
Steady-state scheduling of task graphs on heterogeneous computing platforms (2003)
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be...
Optimizing the steady-state throughput of Broadcasts on heterogeneous platforms (2003)
Legrand, Arnaud, Beaumont, Olivier, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous «grid» platform. Such applications extensively use macro-communication...
Laboratoire de l’Informatique du Parallélisme (2003)
École Normale, Supérieure Lyon, Unité Mixte, Olivier Beaumont, Arnaud Legrand, ...
Steady-state scheduling of task graphs on heterogeneous computing platforms
optimizing the steady-state throughput of Broadcasts on heterogeneous platforms (2003)
Unit Mixte, Arnaud Legrand, Arnaud Legr, ...
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous "grid" platform. Such applications extensively use...
Steady-State Scheduling Of Task Graphs On Heterogeneous Computing Platforms (2003)
Unit Mixte, Arnaud Legrand, Olivier Beaumont, ...
In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent...
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems (2003)
Beaumont, Olivier, Casanova, Henri, Legrand, Arnaud, Robert, Yves, Yang, Yang
Applications in many scientific and engineering domains are structured in large numbers of independent tasks with low granularity. These applications can thus be naturally parallelized, typically in...
Optimizing the steady-state throughput of Broadcasts on heterogeneous platforms (2003)
Legrand, Arnaud, Beaumont, Olivier, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous «grid» platform. Such applications extensively use macro-communication...
Steady-state scheduling of task graphs on heterogeneous computing platforms (2003)
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be...
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems (2003)
Beaumont, Olivier, Casanova, Henri, Legrand, Arnaud, Robert, Yves, Yang, Yang
Applications in many scientific and engineering domains are structured in large numbers of independent tasks with low granularity. These applications can thus be naturally parallelized, typically in...
Optimizing the steady-state throughput of Broadcasts on heterogeneous platforms (2003)
Legrand, Arnaud, Beaumont, Olivier, Marchal, Loris, Robert, Yves
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous «grid» platform. Such applications extensively use macro-communication...
Steady-state scheduling of task graphs on heterogeneous computing platforms (2003)
Beaumont, Olivier, Legrand, Arnaud, Marchal, Loris, Robert, Yves
In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be...
Optimal algorithms for scheduling divisible workloads on heterogeneous systems (2002)
Beaumont, Olivier, Robert, Yves
In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the...
Optimal algorithms for scheduling divisible workloads on heterogeneous systems (2002)
Beaumont, Olivier, Robert, Yves
In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the...
Optimal algorithms for scheduling divisible workloads on heterogeneous systems. (2002)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii)...
Static scheduling strategies for heterogeneous systems. (2002)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we consider static scheduling techniques for heterogeneous systems, such as clusters and grids. We successively deal with minimum makespan scheduling, divisible load scheduling...
Scheduling strategies for mixed data and task parallelism on heterogeneous processor grids. (2002)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to...
Scheduling strategies for master-slave tasking on heterogeneous processor grids. (2002)
Banino, Cyril, Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a non-oriented graph to model a grid,...
A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs. (2002)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different...
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids (2002)
Unit Mixte, Cyril Banino, Olivier Beaumont, Arnaud Legrand, ...
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a non-oriented graph to model a...
Bandwidth-centric allocation of independent tasks on heterogeneous platforms (2002)
Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Yves Robert
platforms
Scheduling Strategies for Mixed Data and Task Parallelism on Heterogeneous Processor Grids (2002)
Unit Mixte, Olivier Beaumont, Arnaud Legrand, ...
In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent...
Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems (2002)
Unit Mixte, Arnaud Legrand, Olivier Beaumont, ...
In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the...
A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors. (2001)
Beaumont, Olivier, Boudet, Vincent, Robert, Yves
(eng) Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them...
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms (2001)
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Robert, Yves
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing...
Bandwidth-centric allocation of independent tasks on heterogeneous platforms. (2001)
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative...
The Iso-Level Scheduling Heuristic for Heterogeneous Processors. (2001)
Beaumont, Olivier, Boudet, Vincent, Robert, Yves
(eng) Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them...
The Master-Slave Paradigm with Heterogeneous Processors (2001)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm...
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the processors...
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the...
The Master-Slave Paradigm with Heterogeneous Processors. (2001)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
(eng) In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial...
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms (2001)
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Robert, Yves
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing...
The Master-Slave Paradigm with Heterogeneous Processors (2001)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm...
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the processors...
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms (2001)
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Robert, Yves
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing...
The Master-Slave Paradigm with Heterogeneous Processors (2001)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm...
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the processors...
Matrix Multiplication on Heterogeneous Platforms (2001)
Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert
this paper, we address the issue of implementing matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous networks of...
The Master-Slave Paradigm with Heterogeneous Processors (2001)
École Normale, Supérieure Lyon, Olivier Beaumont, Arnaud Legrand, Arnaud Legrand, Yves ROBERT .
me amount of processing. . initiated). . exclusive mode. . Pool of independent tasks to be processed by the p slaves. . All tasks are of same-size, i.e. they represent the same amount of processing....
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms (2001)
Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Yves Robert
In this paper, we consider the problem of allocating a large number of independent, equalsized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative...
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms (2001)
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Robert, Yves
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing...
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the processors...
The Master-Slave Paradigm with Heterogeneous Processors (2001)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm...
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms (2001)
Beaumont, Olivier, Carter, Larry, Ferrante, Jeanne, Legrand, Arnaud, Robert, Yves
In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing...
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the processors...
The Master-Slave Paradigm with Heterogeneous Processors (2001)
Beaumont, Olivier, Legrand, Arnaud, Robert, Yves
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm...
Static LU Decomposition on Heterogeneous Platforms. (2000)
Beaumont, Olivier, Legrand, Arnaud, Rastello, Fabrice, Robert, Yves
(eng) In this paper, we deal with algorithmic issues on heterogeneous platforms. We concentrate on dense linear algebra kernels, such as matrix multiplication or LU decomposition. Block cyclic...
Dense Linear Algebra Kernels on Heterogeneous Platforms: Redistribution Issue. (2000)
Beaumont, Olivier, Legrand, Arnaud, Rastello, Fabrice, Robert, Yves
(eng) In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous platforms. In this context, processors speeds may well vary during the execution of a large...
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. (2000)
Beaumont, Olivier, Boudet, Vincent, Rastello, Fabrice, Robert, Yves
(eng) In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s_1, s_2,..., s_p (such that...
Matrix-Matrix Multiplication on Heterogeneous Platforms. (2000)
Beaumont, Olivier, Boudet, Vincent, Rastello, Fabrice, Robert, Yves
(eng) In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous...
Partitioning a square into rectangles: NP-completeness and approximation algorithms (2000)
Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s 1; s 2; : : : ; s p (such that P p...
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s 1 ; s 2 ; : : : ; s p (such that P...
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont Vincent, Olivier Beaumont, ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s 1 ; s 2 ; : : : ; s p (such that P...
Heterogeneity Considered Harmful to Algorithm Designers (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we deal with algorithmic issues on heterogeneous platforms. We show that static scheduling and load-balancing strategies are absolutely needed to achieve good performances, in contrast...
Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert
We study the implementation of dense linear algebra computations, such as matrix multiplication and linear system solvers, on two-dimensional (2D) grids of heterogeneous processors. For these...
Matrix-Matrix Multiplication on Heterogeneous Platforms (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous...
Laboratoire de l'Informatique du Parall elisme (2000)
Unite Mixte, Ecole Normale Superieure, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous platforms. In this context, processors speeds may well vary during the execution of a large kernel,...
A Simplex-Like Algorithm for Interval Linear Systems (1997)
In this paper, we show how it is possible to use convex polyhedra for solving linear interval systems without using preconditionning. We first show how to derive, from an enclosure of...
A Simplex-Like Algorithm for Interval Linear Systems (1997)
Disponible dans les fichiers attachés à ce document
A Simplex-Like Algorithm for Interval Linear Systems (1997)
Disponible dans les fichiers attachés à ce document
A Simplex-Like Algorithm for Interval Linear Systems (1997)
Disponible dans les fichiers attachés à ce document
A Simplex-Like Algorithm for Interval Linear Systems (1997)
Disponible dans les fichiers attachés à ce document