International audienceWe consider the problem of scheduling an application composed of independent tasks on a fully heterogeneous master-worker platform with communication costs. We introduce a bi-criteria approach aiming at maximizing the throughput of the application while minimizing the energy consumed by participating resources. Assuming arbitrary super-linear power consumption laws, we investigate different models, with energy overheads and memory constraints. Building upon closed-form expressions for the uni-processor case, we derive asymptotically optimal solutions for all models
International audienceThis paper presents an efficient approximation algorithm to solve the task sch...
International audienceScheduling independent tasks on a parallel platform is a widely-studied proble...
We revisit the well-known greedy algorithm for scheduling independent jobs on parallel processors, w...
International audienceWe consider the problem of scheduling an application composed of independent t...
In this report, we consider the problem of scheduling an application composed of independent tasks o...
International audienceWe consider the problem of scheduling an application composed of independent t...
International audienceThis paper presents several energy-aware scheduling algorithms whose design is...
Abstract—With the advent of energy-aware scheduling al-gorithms, it is now possible to find solution...
International audienceThe energy consumption of computational platforms has recently become a critic...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and netwo...
Version longue publiée dans Concurrency and Computation: Practice and Experience.International audie...
In the following, we consider the problem of minimizing the energy consumption needed for executing ...
We present a number of novel algorithms, based on mathematical optimization formulations, in order t...
Abstract—This corresponds to the material in the invited keynote presentation by H. J. Siegel, summa...
International audienceThis paper presents an efficient approximation algorithm to solve the task sch...
International audienceScheduling independent tasks on a parallel platform is a widely-studied proble...
We revisit the well-known greedy algorithm for scheduling independent jobs on parallel processors, w...
International audienceWe consider the problem of scheduling an application composed of independent t...
In this report, we consider the problem of scheduling an application composed of independent tasks o...
International audienceWe consider the problem of scheduling an application composed of independent t...
International audienceThis paper presents several energy-aware scheduling algorithms whose design is...
Abstract—With the advent of energy-aware scheduling al-gorithms, it is now possible to find solution...
International audienceThe energy consumption of computational platforms has recently become a critic...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and netwo...
Version longue publiée dans Concurrency and Computation: Practice and Experience.International audie...
In the following, we consider the problem of minimizing the energy consumption needed for executing ...
We present a number of novel algorithms, based on mathematical optimization formulations, in order t...
Abstract—This corresponds to the material in the invited keynote presentation by H. J. Siegel, summa...
International audienceThis paper presents an efficient approximation algorithm to solve the task sch...
International audienceScheduling independent tasks on a parallel platform is a widely-studied proble...
We revisit the well-known greedy algorithm for scheduling independent jobs on parallel processors, w...