Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms (2005)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of...
Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms (2005)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of...
Models for scheduling on large scale platforms: which policy for which application? (2004)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In the recent years, there was a huge development of low cost large scale parallel systems. The design of efficient parallel algorithms has to be reconsidered by the influence of new parameters of...
Scheduling Parallel Tasks: Approximation Algorithms (2004)
Dutot, Pierre-Francois, Mounié, Grégory, Trystram, Denis
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining where and when the tasks of parallel programs will be executed. The design of parallel algorithms...
Scheduling Parallel Tasks: Approximation Algorithms (2004)
Dutot, Pierre-Francois, Mounié, Grégory, Trystram, Denis
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining where and when the tasks of parallel programs will be executed. The design of parallel algorithms...
Models for scheduling on large scale platforms: which policy for which application? (2004)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In the recent years, there was a huge development of low cost large scale parallel systems. The design of efficient parallel algorithms has to be reconsidered by the influence of new parameters of...
Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms (2004)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of...
Master-slave Tasking on Heterogeneous Processors (2004)
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assume that...
Complexity of Master-slave Tasking on (2004)
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...
Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms (2004)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of...
Models for scheduling on large scale platforms: which policy for which application? (2004)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In the recent years, there was a huge development of low cost large scale parallel systems. The design of efficient parallel algorithms has to be reconsidered by the influence of new parameters of...
Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms (2004)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of...
Models for scheduling on large scale platforms: which policy for which application? (2004)
Dutot, Pierre-Francois, Eyraud, Lionel, Mounié, Grégory, Trystram, Denis
In the recent years, there was a huge development of low cost large scale parallel systems. The design of efficient parallel algorithms has to be reconsidered by the influence of new parameters of...
Scheduling Parallel Tasks: Approximation Algorithms (2003)
Dutot, Pierre-Francois, Mounié, Grégory, Trystram, Denis
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining where and when the tasks of parallel programs will be executed. The design of parallel algorithms...
Scheduling Parallel Tasks: Approximation Algorithms (2003)
Dutot, Pierre-Francois, Mounié, Grégory, Trystram, Denis
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining where and when the tasks of parallel programs will be executed. The design of parallel algorithms...