Experimental Validation of Grid Algorithms: a Comparison of Methodologies (2009)
The increasing complexity of available infrastructures with specific features (caches, hyperthreading, dual core, etc.) or with complex architectures (hierarchical, parallel, distributed, etc.) makes...
Scheduling Strategies for the Bicriteria Optimization of the Robustness and Makespan (2009)
Louis-claude Canon, Emmanuel Jeannot
In this paper we study the problem of scheduling a stochastic task graph with the objective of minimizing the makespan and maximizing the robustness. As these two metrics are not equivalent, we need...
TOTAL EXCHANGE PERFORMANCE PREDICTION ON GRID ENVIRONMENTS modeling and algorithmic issues (2009)
Luiz Angelo Steffenel, Emmanuel Jeannot
Keywords: One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have been studied...
COMPARATIVE EVALUATION OF THE ROBUSTNESS OF DAG SCHEDULING HEURISTICS (2009)
Louis-claude Canon, Emmanuel Jeannot, Rizos Sakellariou, Wei Zheng
Keywords: In this paper we analyze the robustness of 20 static, makespan-centric, DAG scheduling heuristics of the literature. We also study if dynamically changing the order of the tasks on their...
Thème Num, Y Berten, Joël Goossens, Emmanuel Jeannot, Projet Algorille
LORIA, Technopôle de Nancy-Brabois, Campus scientifique, On the distribution of sequential jobs in random brokering for heterogeneous computational grids
apport de rechercheManaging Data Persistence in Network Enabled Servers ∗ (2009)
Eddy Caron, Bruno Delfabbro, Frédéric Desprez, Thème Num, Eddy Caron, ...
Abstract: The GridRPC model [17] is an emerging standard promoted by the Global Grid Forum (GGF) † that defines how to perform remote client-server computations on a distributed architecture. In...
Yves Caniou, Emmanuel Jeannot, Thłme Com, Yves Caniou, Emmanuel Jeannot, ...
Abstract: The Historical Trace Manager is a task duration predictor module embedded in the agent of a Problem Solving Environment relying on the client-agent-server. The HTM is introduced in [CJ02a]...
Frédéric Wagner, Emmanuel Jeannot, Frédéric Wagner, Emmanuel Jeannot, Projets Algorille
Rapport de recherche n ° 5361 — Novembre 2004 —14 pages Abstract: In this report we study the problem of scheduling messages between two parallel machines connected by a low latency network (LAN...
Louis-claude Canon, Emmanuel Jeannot, Thème Num, Louis-claude Canon, Emmanuel Jeannot
de recherche
Clusters on Low Latency Networks (2009)
Emmanuel Jeannot, Emmanuel Jeannot
The`me 1-- Re'seaux et syste`mesProjets Algorille
Emmanuel Jeannot, Frédéric Wagner, Redistribution An, Emmanuel Jeannot, Frédéric Wagner
Data redistribution has been widely studied in the literature. In recent years, several papers proposed scheduling algorithms to execute redistributions under different constraints in a minimal...
Experimental Validation in Large-Scale Systems: a Survey of Methodologies (2009)
Gustedt, Jens, Jeannot, Emmanuel, Quinson, Martin
The increasing complexity of available infrastructures with specific features (caches, hyperthreading, dual core, etc.) or with complex architectures (hierarchical, parallel, distributed, etc.) makes...
Experimental Validation in Large-Scale Systems: a Survey of Methodologies (2009)
Gustedt, Jens, Jeannot, Emmanuel, Quinson, Martin
The increasing complexity of available infrastructures with specific features (caches, hyperthreading, dual core, etc.) or with complex architectures (hierarchical, parallel, distributed, etc.) makes...
Precise Evaluation of the Efficiency and the Robustness of Stochastic DAG Schedules (2009)
Canon, Louis-Claude, Jeannot, Emmanuel
This study is devoted to the evaluation of schedules of parallel applications consisting of a set of stochastic tasks having precedence constraints between them. This is an important issue when the...
Precise Evaluation of the Efficiency and the Robustness of Stochastic DAG Schedules (2009)
Canon, Louis-Claude, Jeannot, Emmanuel
This study is devoted to the evaluation of schedules of parallel applications consisting of a set of stochastic tasks having precedence constraints between them. This is an important issue when the...
Precise Evaluation of the Efficiency and the Robustness of Stochastic DAG Schedules (2009)
Canon, Louis-Claude, Jeannot, Emmanuel
This study is devoted to the evaluation of schedules of parallel applications consisting of a set of stochastic tasks having precedence constraints between them. This is an important issue when the...
Precise Evaluation of the Efficiency and the Robustness of Stochastic DAG Schedules (2009)
Canon, Louis-Claude, Jeannot, Emmanuel
This study is devoted to the evaluation of schedules of parallel applications consisting of a set of stochastic tasks having precedence constraints between them. This is an important issue when the...
Experimental Validation in Large-Scale Systems: a Survey of Methodologies (2009)
Gustedt, Jens, Jeannot, Emmanuel, Quinson, Martin
The increasing complexity of available infrastructures with specific features (caches, hyperthreading, dual core, etc.) or with complex architectures (hierarchical, parallel, distributed, etc.) makes...
Experimental Validation in Large-Scale Systems: a Survey of Methodologies (2009)
Gustedt, Jens, Jeannot, Emmanuel, Quinson, Martin
The increasing complexity of available infrastructures with specific features (caches, hyperthreading, dual core, etc.) or with complex architectures (hierarchical, parallel, distributed, etc.) makes...
Emmanuel Jeannot, Thème Num, Emmanuel Jeannot, Projet Algorille
It is a user-level set of functions that enables data transmission with compression. The compression is performed dynamically during the transmission and the compression level is constantly adapted...
Managing Data Persistence in Network Enabled Servers 2 (2008)
École Normale, Supérieure Lyon, Eddy Caron, Bruno Delfabbro, Frédéric Desprez, Emmanuel Jeannot, ...
The GridRPC model [17] is an emerging standard promoted by the Global Grid Forum (GGF) 3 that defines how to perform remote clientserver computations on a distributed architecture. In this model data...
Wrekavoc: a Tool for Emulating Heterogeneity (2008)
Louis-claude Canon, Emmanuel Jeannot
Computer science and especially heterogeneous distributed computing is an experimental science. Simulation, emulation, or in-situ implementation are complementary methodologies to conduct experiments...
Fast and Efficient Total Exchange on Two Clusters (2008)
Emmanuel Jeannot, Luiz Angelo Steffenel
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total exchange...
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments (2008)
Canon, Louis-Claude, Jeannot, Emmanuel
A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different...
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments (2008)
Canon, Louis-Claude, Jeannot, Emmanuel
A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different...
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments (2008)
Canon, Louis-Claude, Jeannot, Emmanuel
A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different...
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments (2008)
Canon, Louis-Claude, Jeannot, Emmanuel
A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different...
Multi-Site Emulation using Wrekavoc: Validating Distributed Algorithms and Applications (2008)
Dubuisson, Olivier, Gustedt, Jens, Jeannot, Emmanuel
Experimental validation and testing of solutions designed for heterogeneous environment is a challenging issue. Wrekavoc is a tool for performing such validation. It runs an unmodified applications...
Multi-Site Emulation using Wrekavoc: Validating Distributed Algorithms and Applications (2008)
Dubuisson, Olivier, Gustedt, Jens, Jeannot, Emmanuel
Experimental validation and testing of solutions designed for heterogeneous environment is a challenging issue. Wrekavoc is a tool for performing such validation. It runs an unmodified applications...
In this paper we describe a code generator prototype that uses parameterized task graphs (PTGs) as an intermediate model and generates a multithreaded code. A PTG is a compact and a problem size...
L'objectif des travaux que j'ai mené depuis ma thèse est de rendre possible l'exécution efficace d'applications sur les infrastructures parallèles. Ce document présente donc les problématiques...
Fast and Efficient Total Exchange on Two Clusters (2007)
Jeannot, Emmanuel, Steffenel, Luiz Angelo
Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total exchange redistribution...
Total Exchange Performance Prediction on Grid Environments: modeling and algorithmic issues (2007)
Steffenel, Luiz Angelo, Jeannot, Emmanuel
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have been studied for...
Dongarra, Jack, Jeannot, Emmanuel, Saule, Erik, Shi, Zhiao
We tackle the problem of scheduling task graphs onto a heterogeneous set of machines, where each processor has a probability of failure governed by an exponential law. The goal is to design...
A Comparison of Robustness Metrics for Scheduling DAGs on Heterogeneous Systems (2007)
Canon, Louis-Claude, Jeannot, Emmanuel
A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different...
A Comparison of Robustness Metrics for Scheduling DAGs on Heterogeneous Systems (2007)
Canon, Louis-Claude, Jeannot, Emmanuel
A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led to a lot of different...
Total Exchange Performance Prediction on Grid Environments: modeling and algorithmic issues (2007)
Steffenel, Luiz Angelo, Jeannot, Emmanuel
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have been studied for...
Total Exchange Performance Prediction on Grid Environments: modeling and algorithmic issues (2007)
Steffenel, Luiz Angelo, Jeannot, Emmanuel
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have been studied for...
Fast and Efficient Total Exchange on Two Clusters (2007)
Jeannot, Emmanuel, Steffenel, Luiz Angelo
Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called ${\mathcal LG}$ for the total exchange...
Fast and Efficient Total Exchange on Two Clusters (2007)
Jeannot, Emmanuel, Steffenel, Luiz Angelo
Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called ${\mathcal LG}$ for the total exchange...
L'objectif des travaux que j'ai mené depuis ma thèse est de rendre possible l'exécution efficace d'applications sur les infrastructures parallèles. Ce document présente donc les problématiques...
L'objectif des travaux que j'ai mené depuis ma thèse est de rendre possible l'exécution efficace d'applications sur les infrastructures parallèles. Ce document présente donc les problématiques...
L'objectif des travaux que j'ai mené depuis ma thèse est de rendre possible l'exécution efficace d'applications sur les infrastructures parallèles. Ce document présente donc les problématiques...
Dongarra, Jack, Jeannot, Emmanuel, Saule, Erik, Shi, Zhiao
We tackle the problem of scheduling task graphs onto a heterogeneous set of machines, where each processor has a probability of failure governed by an exponential law. The goal is to design...
A Comparison of Robustness Metrics for Scheduling DAGs on Heterogeneous Systems (2007)
Louis-claude Canon, Emmanuel Jeannot
Abstract — A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led to a lot...
Jack J. Dongarra, Erik Saule, Emmanuel Jeannot, Zhiao Shi
We tackle the problem of scheduling task graphs onto a heterogeneous set of machines, where each processor has a probability of failure governed by an exponential law. The goal is to design...
A Practical Approach of Diffusion Load Balancing Algorithms (2006)
Jeannot, Emmanuel, Vernier, Flavien
In this paper, a practical approach of diffusion load balancing algorithms and its implementation are studied. Three problems are investigated. The first is the determination of the load balancing...
Berten, Vandy, Goossens, Joël, Jeannot, Emmanuel
Scheduling stochastic workloads is a difficult task. In order to design efficient scheduling algorithms for such workloads, it is required to have a good in-depth knowledge of basic random scheduling...
Berten, Vandy, Goossens, Joël, Jeannot, Emmanuel
Scheduling stochastic workloads is a difficult task. In order to design efficient scheduling algorithms for such workloads, it is required to have a good in-depth knowledge of basic random scheduling...
A Practical Approach of Diffusion Load Balancing Algorithms (2006)
Jeannot, Emmanuel, Vernier, Flavien
In this paper, a practical approach of diffusion load balancing algorithms and its implementation are studied. Three problems are investigated. The first is the determination of the load balancing...
A Practical Approach of Diffusion Load Balancing Algorithms (2006)
Jeannot, Emmanuel, Vernier, Flavien
In this paper, a practical approach of diffusion load balancing algorithms and its implementation are studied. Three problems are investigated. The first is the determination of the load balancing...
Messages Scheduling for Parallel Data Redistribution between Clusters (2006)
Johanne Cohen, Emmanuel Jeannot, Nicolas Padoy, Frédéric Wagner
Abstract—We study the problem of redistributing data between clusters interconnected by a backbone. We suppose that at most k communications can be performed at the same time (the value of k...
Emmanuel Jeannot, Keith Seymour, Jack J. Dongarra
Communicated by Guest Editors In this paper we address the problem of accurately estimating the runtime and communication time of a client request in a Network Enabled Server (NES) middleware such as...
Flexible collective communication tuning architecture applied to open MPI (2006)
Graham E. Fagg, Jelena Pjesivac-grbovic, George Bosilca, Jack J. Dongarra, Emmanuel Jeannot
Abstract. Collective communications are invaluable to modern high performance applications, although most users of these communication patterns do not always want to know their inner most working....
A Probabilistic Approach for Fault Tolerant Multiprocessor Realtime Scheduling (2006)
Y Berten, Joël Goossens, Emmanuel Jeannot
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probability. For each task we...
Robust task scheduling in non-deterministic heterogeneous computing systems (2006)
Zhiao Shi, Emmanuel Jeannot, Jack J. Dongarra
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing system. Due to the...
Managing Data Persistence in Network Enabled Servers (2005)
Caron, Eddy, Delfabbro, Bruno, Desprez, Frédéric, Jeannot, Emmanuel, Nicod, Jean-Marc
The GridRPC model is an emerging standard promoted by the Global Grid Forum (GGF) that defines how to perform remote client-server computations on a distributed architecture. In this model data are...
Berten, Vandy, Goossens, Joël, Jeannot, Emmanuel
This paper analyzes the way sequential jobs are distributed and the system behaves in a heterogeneous computational grid environment where the brokering is done in such a way that each Computing...
In this article, we present the AdOC (Adaptive Online Compression) library. It is a user-level set of functions that enables data transmission with compression. The compression is performed...
Grid-Enabling Medical Image Analysis (2005)
Germain, C., Breton, V., Clarysse, P., Gaudeau, Y., Glatard, T., Jeannot, Emmanuel, ...
Digital medical image processing is a promising application area for grids. Given the volume of data, the sensitivity of medical information, and the joint complexity of medical datasets and...
Computing Molecular Potential Energy Surface with DIET (2005)
Jeannot, Emmanuel, Monard, Gerard
New developments in the field of theoretical chemistry require the computation of numerous Molecular Potential Energy Surfaces (PESs) to generate adequate quantum force field parameters. Because...
In this article, we present the AdOC (Adaptive Online Compression) library. It is a user-level set of functions that enables data transmission with compression. The compression is performed...
Grid'5000: a large scale, reconfigurable, controlable and monitorable Grid platform (2005)
Cappello, Franck, Desprez, Frédéric, Dayde, Michel, Jeannot, Emmanuel, Jegou, Yvon, Lanteri, Stéephane, ...
Berten, Vandy, Goossens, Joël, Jeannot, Emmanuel
This paper analyzes the way sequential jobs are distributed and the system behaves in a heterogeneous computational grid environment where the brokering is done in such a way that each Computing...
Managing Data Persistence in Network Enabled Servers (2005)
Caron, Eddy, Delfabbro, Bruno, Desprez, Frédéric, Jeannot, Emmanuel, Nicod, Jean-Marc
The GridRPC model [17] is an emerging standard promoted by the Global Grid Forum (GGF) that defines how to perform remote client-server computations on a distributed architecture. In this model data...
Grid-Enabling Medical Image Analysis (2005)
Germain, C., Breton, V., Clarysse, P., Gaudeau, Y., Glatard, T., Jeannot, Emmanuel, ...
Digital medical image processing is a promising application area for grids. Given the volume of data, the sensitivity of medical information, and the joint complexity of medical datasets and...
Computing Molecular Potential Energy Surface with DIET (2005)
Jeannot, Emmanuel, Monard, Gerard
New developments in the field of theoretical chemistry require the computation of numerous Molecular Potential Energy Surfaces (PESs) to generate adequate quantum force field parameters. Because...
In this article, we present the AdOC (Adaptive Online Compression) library. It is a user-level set of functions that enables data transmission with compression. The compression is performed...
Grid'5000: a large scale, reconfigurable, controlable and monitorable Grid platform (2005)
Cappello, Franck, Desprez, Frédéric, Dayde, Michel, Jeannot, Emmanuel, Jegou, Yvon, Lanteri, Stéephane, ...
Berten, Vandy, Goossens, Joël, Jeannot, Emmanuel
This paper analyzes the way sequential jobs are distributed and the system behaves in a heterogeneous computational grid environment where the brokering is done in such a way that each Computing...
Managing Data Persistence in Network Enabled Servers (2005)
Caron, Eddy, Delfabbro, Bruno, Desprez, Frédéric, Jeannot, Emmanuel, Nicod, Jean-Marc
The GridRPC model [17] is an emerging standard promoted by the Global Grid Forum (GGF) that defines how to perform remote client-server computations on a distributed architecture. In this model data...
Managing Data Persistence in Network Enabled Servers (2005)
Caron, Eddy, Delfabbro, Bruno, Desprez, Frédéric, Jeannot, Emmanuel, Nicod, Jean-Marc
The GridRPC model is an emerging standard promoted by the Global Grid Forum (GGF) that defines how to perform remote client-server computations on a distributed architecture. In this model data are...
Berten, Vandy, Goossens, Joël, Jeannot, Emmanuel
This paper analyzes the way sequential jobs are distributed and the system behaves in a heterogeneous computational grid environment where the brokering is done in such a way that each Computing...
In this article, we present the AdOC (Adaptive Online Compression) library. It is a user-level set of functions that enables data transmission with compression. The compression is performed...
Managing Data Persistence in Network Enabled Servers (2005)
Caron, Eddy, Delfabbro, Bruno, Desprez, Frédéric, Jeannot, Emmanuel, Nicod, Jean-Marc
The GridRPC model is an emerging standard promoted by the Global Grid Forum (GGF) that defines how to perform remote client-server computations on a distributed architecture. In this model data are...
Berten, Vandy, Goossens, Joël, Jeannot, Emmanuel
This paper analyzes the way sequential jobs are distributed and the system behaves in a heterogeneous computational grid environment where the brokering is done in such a way that each Computing...
In this article, we present the AdOC (Adaptive Online Compression) library. It is a user-level set of functions that enables data transmission with compression. The compression is performed...
Grid-enabling medical image analysis (2005)
Germain, Cécile, Breton, Vincent, Clarysse, Patrick, Gaudeau, Yann, Glatard, Tristan, Jeannot, Emmanuel, ...
Grids have emerged as a promising technology to handle the data and compute intensive requirements of many application areas. Digital medical image processing is a promising application area for...
Grid-enabling medical image analysis (2005)
Germain, Cécile, Breton, Vincent, Clarysse, Patrick, Gaudeau, Yann, Glatard, Tristan, Jeannot, Emmanuel, ...
Grids have emerged as a promising technology to handle the data and compute intensive requirements of many application areas. Digital medical image processing is a promising application area for...
Grid-enabling medical image analysis (2005)
Germain, Cécile, Breton, Vincent, Clarysse, Patrick, Gaudeau, Yann, Glatard, Tristan, Jeannot, Emmanuel, ...
Grids have emerged as a promising technology to handle the data and compute intensive requirements of many application areas. Digital medical image processing is a promising application area for...
Yves Caniou, Yves Caniou, Emmanuel Jeannot, Emmanuel Jeannot
In this paper, we address the problem of dynamically scheduling independent tasks and/or application task graphs on a GridRPC environment. Resources are assumed to compute submitted jobs within the...
Computing Molecular Potential Energy Surface with DIET (2005)
Emmanuel Jeannot, Henri Poincaré, Gérald Monard, Henri Poincaré
New developments in the field of theoretical chemistry require the computation of numerous Molecular Potential Energy Surfaces (PESs) to generate adequate quantum force field parameters. Because...
In this article, we present the AdOC (Adaptive Online Compression) library. It is a user-level set of functions that enables data transmission with compression. The compression is performed...
Modelizing, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks (2004)
Wagner, Frédéric, Jeannot, Emmanuel
In this report we study the problem of scheduling messages between two parallel machines connected by a low latency network (LAN for instance). The problem of scheduling messages appears in code...
Improvements and Study of the Accuracy of the Tasks Duration Predictor, New Heuristics (2004)
Caniou, Yves, Jeannot, Emmanuel
The Historical Trace Manager is a task duration predictor module embedded in the agent of a Problem Solving Environment relying on the client-agent-server. The HTM is introduced in and . In this...
Caniou, Yves, Jeannot, Emmanuel
We compare some dynamic scheduling heuristics that have shown good performances on simulation study against MCT on experiments on real solving platforms. The heuristics rely on a prediction module,...
Message Scheduling for Data Redistribution through High Performance Networks (2004)
Wagner, Frédéric, Jeannot, Emmanuel
With the emergence of large scale distributed computing, new problems bound to data transfers are appearing. We present here the problem of data redistribution between two clusters connected by a...
Modelizing, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks (2004)
Wagner, Frédéric, Jeannot, Emmanuel
In this report we study the problem of scheduling messages between two parallel machines connected by a low latency network (LAN for instance). The problem of scheduling messages appears in code...
Improvements and Study of the Accuracy of the Tasks Duration Predictor, New Heuristics (2004)
Caniou, Yves, Jeannot, Emmanuel
The Historical Trace Manager is a task duration predictor module embedded in the agent of a Problem Solving Environment relying on the client-agent-server. The HTM is introduced in and . In this...
Caniou, Yves, Jeannot, Emmanuel
We compare some dynamic scheduling heuristics that have shown good performances on simulation study against MCT on experiments on real solving platforms. The heuristics rely on a prediction module,...
Message Scheduling for Data Redistribution through High Performance Networks (2004)
Wagner, Frédéric, Jeannot, Emmanuel
With the emergence of large scale distributed computing, new problems bound to data transfers are appearing. We present here the problem of data redistribution between two clusters connected by a...
Message Scheduling for Data Redistribution through High Performance Networks (2004)
Wagner, Frédéric, Jeannot, Emmanuel
With the emergence of large scale distributed computing, new problems bound to data transfers are appearing. We present here the problem of data redistribution between two clusters connected by a...
Caniou, Yves, Jeannot, Emmanuel
We compare some dynamic scheduling heuristics that have shown good performances on simulation study against MCT on experiments on real solving platforms. The heuristics rely on a prediction module,...
Improvements and Study of the Accuracy of the Tasks Duration Predictor, New Heuristics (2004)
Caniou, Yves, Jeannot, Emmanuel
The Historical Trace Manager is a task duration predictor module embedded in the agent of a Problem Solving Environment relying on the client-agent-server. The HTM is introduced in and . In this...
Modelizing, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks (2004)
Wagner, Frédéric, Jeannot, Emmanuel
In this report we study the problem of scheduling messages between two parallel machines connected by a low latency network (LAN for instance). The problem of scheduling messages appears in code...
Experimental study of multi-criteria scheduling heuristics for GridRPC systems (2004)
Yves Caniou, Emmanuel Jeannot, Loria Inria-lorraine
Abstract. We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important feature. However,...
Efficient Scheduling Heuristics for GridRPC Systems (2004)
In this paper we examine several scheduling heuristics for GridRPC middleware relying on the time-shared model (a server can execute more than one task at a time). Our work is based on a forecast...
Emmanuel Jeannot, H. Poincaré, Frédéric Wagner
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches. In the first...
Message scheduling for data redistribution through high performance networks (2004)
Emmanuel Jeannot, Emmanuel Jeannot
The`me 1-- Re'seaux et syste`mesProjets Algorille
Improving the GridRPC Model with Data Persistence and Redistribution (2004)
Frédéric Desprez, Emmanuel Jeannot
Abstract — The GridRPC model [1] is an emerging standard promoted by the Global Grid Forum (GGF) 1 that defines how to perform remote client-server computation on a distributed architecture. In...
Emmanuel Jeannot, Frédéric Wagner
In this paper we study the problem of redistributing in parallel data between clusters interconnected by a backbone. This problem is a generalization of the well-known redistribution problem that...
Parallel Data Redistribution Over a Backbone (2003)
Cohen, Johanne, Jeannot, Emmanuel, Padoy, Nicolas
In this report we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to...
Parallel Data Redistribution Over a Backbone (2003)
Cohen, Johanne, Jeannot, Emmanuel, Padoy, Nicolas
In this report we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to...
Parallel Data Redistribution Over a Backbone (2003)
Cohen, Johanne, Jeannot, Emmanuel, Padoy, Nicolas
In this report we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to...
In this paper, we tackle the problem of redistributing data between clusters connected by a backbone. On distributed environments, communications often take more time [12] and thus lead to worse...
Johanne Cohen, Emmanuel Jeannot, Nicolas Padoy
Abstract. In this paper we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish...
New Dynamic Heuristics in the Client-Agent-Server Model (2003)
MCT is a widely used heuristic for scheduling tasks onto grid platforms. However, when dealing with many tasks, MCT tends to dramatically delay already mapped task completion time, while scheduling a...
Scheduling on the Grid : Historical Trace and Dynamic Heuristics (2002)
Caniou, Yves, Jeannot, Emmanuel
We present a historical trace manager and new dynamic scheduling heuristics that can be used, and are studied, in the client-agent-server model on the `grid'. These heuristics rely on the common...
Adaptive Online Data Compression (2002)
Quickly transmitting huge data in the context of distributed computing on wide area network can be achieved by compressing data before transmission. However, such an approach is not efficient when...
Scheduling on the Grid : Historical Trace and Dynamic Heuristics (2002)
Caniou, Yves, Jeannot, Emmanuel
We present a historical trace manager and new dynamic scheduling heuristics that can be used, and are studied, in the client-agent-server model on the `grid'. These heuristics rely on the common...
Adaptive Online Data Compression (2002)
Quickly transmitting huge data in the context of distributed computing on wide area network can be achieved by compressing data before transmission. However, such an approach is not efficient when...
Adaptive Online Data Compression (2002)
Quickly transmitting huge data in the context of distributed computing on wide area network can be achieved by compressing data before transmission. However, such an approach is not efficient when...
Scheduling on the Grid : Historical Trace and Dynamic Heuristics (2002)
Caniou, Yves, Jeannot, Emmanuel
We present a historical trace manager and new dynamic scheduling heuristics that can be used, and are studied, in the client-agent-server model on the `grid'. These heuristics rely on the common...
Adaptive Online Data Compression (2002)
Emmanuel Jeannot, Nancy I, Bjorn Knutsson, Mats Bjorkman
Quickly transmitting large datasets in the context of distributed computing on wide area networks can be achieved by compressing data before transmission. However, such an approach is not efficient...
Adaptive Online Data Compression (2002)
Emmanuel Jeannot, Emmanuel Jeannot, Projet Rsdas
Quickly transmitting huge data in the context of distributed computing on wide area network can be achieved by compressing data before transmission. However, such an approach is not ecient when...
Adaptive Online Data Compression (2002)
Emmanuel Jeannot, Loria Inria-lorraine, Nancy I, Mats Björkman, Björn Knutsson
Quickly transmitting large datasets in the context of distributed computing on wide area networks can be achieved by compressing data before transmission. However, such an approach is not efficient...
Triplet : a Clustering Scheduling Algorithm for Heterogeneous Platforms (2001)
Cirou, Bertrand, Jeannot, Emmanuel
In this report we present a new scheduling algorithm for heterogeneous plate-forms. It uses the clustering techniques and has a better behavior than the HEFT algorithm in most of the cases.
Scilab to Scilab//, the OURAGAN Project (2001)
Caron, Eddy, Chaumette, Serge, Contassot-Vivier, Sylvain, Desprez, Frédéric, Fleury, Eric, Gomez, Claude, ...
In this paper, we present the developments realized in the "Ouragan" project around the parallelization of a "Matlab"-like tool called S"CILAB". These developments use high-performance numerical...
Scilab to Scilab//, the OURAGAN Project (2001)
Caron, Eddy, Chaumette, Serge, Contassot-Vivier, Sylvain, Desprez, Frédéric, Fleury, Eric, Gomez, Claude, ...
In this paper, we present the developments realized in the "Ouragan" project around the parallelization of a "Matlab"-like tool called S"CILAB". These developments use high-performance numerical...
SCILAB to SCILAB - The Ouragan Project (2001)
Desprez, Frédéric, Quinson, Martin, Suter, Frédéric, Fleury, Eric, Jeannot, Emmanuel, Gomez, Claude, ...
In this paper, we present the developments realized in the OURAGAN project around the parallelization of a MATLAB-like tool called SCILAB. These developments use high performance numerical libraries...
Triplet : a Clustering Scheduling Algorithm for Heterogeneous Platforms (2001)
Cirou, Bertrand, Jeannot, Emmanuel
In this report we present a new scheduling algorithm for heterogeneous plate-forms. It uses the clustering techniques and has a better behavior than the HEFT algorithm in most of the cases.
SCILAB to SCILAB - The Ouragan Project (2001)
Desprez, Frédéric, Quinson, Martin, Suter, Frédéric, Fleury, Eric, Jeannot, Emmanuel, Gomez, Claude, ...
In this paper, we present the developments realized in the OURAGAN project around the parallelization of a MATLAB-like tool called SCILAB. These developments use high performance numerical libraries...
Triplet : a Clustering Scheduling Algorithm for Heterogeneous Platforms (2001)
Cirou, Bertrand, Jeannot, Emmanuel
In this report we present a new scheduling algorithm for heterogeneous plate-forms. It uses the clustering techniques and has a better behavior than the HEFT algorithm in most of the cases.
Triplet: a Clustering Scheduling Algorithm for Heterogeneous Systems (2001)
Bertrand Cirou, Emmanuel Jeannot
The goal of the OURAGAN project is to provide access of meta-computing resources to Scilab users. We present here an approach that consists, given a Scilab script, in scheduling and executing this...
Triplet: a Clustering Scheduling Algorithm for Heterogeneous Systems (2001)
Bertrand Cirou, Bertrand Cirou, Emmanuel Jeannot, Emmanuel Jeannot, Projet Rsdas
apport technique
Triplet: a Clustering Scheduling Algorithm for Heterogeneous Systems (2001)
Bertrand Cirou, Emmanuel Jeannot
The goal of the OURAGAN project is to provide access of meta-computing resources to Scilab users. We present here an approach that consists, given a Scilab script, in scheduling and executing this...
Automatic Code Generation in the Task Graph Model (2000)
Emmanuel Jeannot, Emmanuel Jeannot
: The task graph model is a widely used model for performance prediction and scheduling of parallel applications. When used for automatically building parallel program it presents two major...
Compact DAG Representation and Its Dynamic Scheduling (1999)
Michel Cosnard, Emmanuel Jeannot, Loria Inria Lorraine
Abstract Scheduling large task graphs is an important issue in parallel computing. In this paper we tackle the two following problems: (1) how to schedule a task graph, when it is too large to t into...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
Symbolic Partitionning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computingsince it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Ecole Normale, Sup Lyon, Michel Cosnard, Michel Cosnard, Emmanuel Jeannot, Emmanuel Jeannot, ...
Scheduling large task graphs is an important issue in parallel computing since it allows the treatment of big size problems. In this report we tackle the following problem: how to schedule a task...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Villiers Les Nancy, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computing since it allows to treat big size problems. In this paper we address the following problem: how to schedule a task graph, when...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot, Loria Inria Lorraine
Scheduling large task graphs is animportant issue in parallel computingsince it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task graph,...
Symbolic Partitioning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Michel Cosnard, Emmanuel Jeannot, Emmanuel Jeannot, Tao Yang, Tao Yang
A parameterized task graph is a model of computation which is small and problem size independent (i.e. it requires the same amount of memory, whatever the size of the program parameters is). Here, we...
Symbolic Partitionning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computing since it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task...