Scheduling on Large Scale Distributed Platforms: From Models to Implementations (2007)
Dutot, Pierre-François, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In this paper, we will investigate two complementary computational models that have been proposed recently: Parallel Task (PT) and Divisible Load (DL). The Parallel Task (i.e. tasks that require more...
Scheduling on Large Scale Distributed Platforms: From Models to Implementations (2007)
Dutot, Pierre-François, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In this paper, we will investigate two complementary computational models that have been proposed recently: Parallel Task (PT) and Divisible Load (DL). The Parallel Task (i.e. tasks that require more...
Hierarchical Scheduling for Moldable Tasks (2006)
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level of...
Scheduling moldable {BSP} tasks (2006)
Dutot, Pierre-François, Goldman, Alfredo, Kon, Fabio, Netto, Marco
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use less processors...
Scheduling Moldable Tasks for Dynamic {SMP} Clusters in {S}o{C} Technology (2006)
Masko, Lukasz, Dutot, Pierre-François, Mounié, Grégory, Trystram, Denis, Tudruj, Marek
The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on the fly. The algorithm is...
A best-compromise bicriteria scheduling algorithm for malleable tasks (2006)
Dutot, Pierre-François, Trystram, Denis
We consider in this paper the problem of scheduling a set of inde- pendent parallel tasks (jobs) with respect to two criteria, namely, the makespan (time of the last finishing job) and the minsum...
Master-slave Tasking on Heterogeneous Processors (2006)
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are differ- ent. We assume that...
Scheduling on hierarchical clusters using malleable tasks (2006)
Dutot, Pierre-François, Trystram, Denis
The model of malleable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level...
Scheduling Moldable Tasks for Dynamic {SMP} Clusters in {S}o{C} Technology (2006)
Masko, Lukasz, Dutot, Pierre-François, Mounié, Grégory, Trystram, Denis, Tudruj, Marek
The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on the fly. The algorithm is...
Hierarchical Scheduling for Moldable Tasks (2006)
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level of...
Scheduling moldable {BSP} tasks (2006)
Dutot, Pierre-François, Goldman, Alfredo, Kon, Fabio, Netto, Marco
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use less processors...
A best-compromise bicriteria scheduling algorithm for malleable tasks (2006)
Dutot, Pierre-François, Trystram, Denis
We consider in this paper the problem of scheduling a set of inde- pendent parallel tasks (jobs) with respect to two criteria, namely, the makespan (time of the last finishing job) and the minsum...
Master-slave Tasking on Heterogeneous Processors (2006)
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are differ- ent. We assume that...
Scheduling on hierarchical clusters using malleable tasks (2006)
Dutot, Pierre-François, Trystram, Denis
The model of malleable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level...
Complexity of Master-slave Tasking on Heterogeneous Trees (2006)
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors and network, where processing times and communications times are different. We assume that...
Complexity of Master-slave Tasking on Heterogeneous Trees (2006)
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors and network, where processing times and communications times are different. We assume that...
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution (2006)
Les nouveaux supports d'exécution que sont les grilles de processeurs apparaissent aujourd'hui comme une alternative économiquement viable aux grands systèmes de calcul centralisés. De grands...
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution (2006)
Les nouveaux supports d'exécution que sont les grilles de processeurs apparaissent aujourd'hui comme une alternative économiquement viable aux grands systèmes de calcul centralisés. De grands...
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution (2006)
Les nouveaux supports d'exécution que sont les grilles de processeurs apparaissent aujourd'hui comme une alternative économiquement viable aux grands systèmes de calcul centralisés. De grands...
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution (2006)
Les nouveaux supports d'exécution que sont les grilles de processeurs apparaissent aujourd'hui comme une alternative économiquement viable aux grands systèmes de calcul centralisés. De grands...
Scheduling Moldable Tasks for Dynamic {SMP} Clusters in {S}o{C} Technology (2005)
Masko, Lukasz, Dutot, Pierre-François, Mounié, Grégory, Trystram, Denis, Tudruj, Marek
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on the fly. The...
Hierarchical Scheduling for Moldable Tasks (2005)
Abstract. The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a...
Complexity of Master-slave Tasking on Heterogeneous Trees (2005)
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors and network, where processing times and communications times are different. We assume that...
Scheduling moldable {BSP} tasks (2005)
Dutot, Pierre-François, Goldman, Alfredo, Kon, Fabio, Netto, Marco
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use less processors...
A best-compromise bicriteria scheduling algorithm for malleable tasks (2005)
Dutot, Pierre-François, Trystram, Denis
We consider in this paper the problem of scheduling a set of inde- pendent parallel tasks (jobs) with respect to two criteria, namely, the makespan (time of the last finishing job) and the minsum...
SCHEDULING ON LARGE SCALE DISTRIBUTED PLATFORMS: FROM MODELS TO IMPLEMENTATIONS (2005)
Dutot, Pierre-François, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In this paper, we will investigate two complementary computational models that have been proposed recently: Parallel Task (PT) and Divisible Load (DL). The Parallel Task (i.e. tasks that require more...
SCHEDULING ON LARGE SCALE DISTRIBUTED PLATFORMS: FROM MODELS TO IMPLEMENTATIONS (2005)
Dutot, Pierre-François, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In this paper, we will investigate two complementary computational models that have been proposed recently: Parallel Task (PT) and Divisible Load (DL). The Parallel Task (i.e. tasks that require more...
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution (2004)
Les nouveaux supports d'exécution que sont les grilles de processeursapparaissent aujourd'hui comme une alternative économiquement viable aux grands systèmes de calcul centralisés. De grands...
Algorithmes d'ordonnancement pour les nouveaux supports d'exécution (2004)
Les nouveaux supports d'exécution que sont les grilles de processeursapparaissent aujourd'hui comme une alternative économiquement viable aux grands systèmes de calcul centralisés. De grands...
Master-slave Tasking on Heterogeneous Processors (2003)
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are differ- ent. We assume that...
Scheduling on hierarchical clusters using malleable tasks (2001)
Dutot, Pierre-François, Trystram, Denis
The model of malleable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level...