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 for energy consumption, with and without start-up overheads. Building upon closed-form expressions for the uniprocessor case, we derive optimal or asymptotically optimal solutions for both models
peer reviewedWe address the problem of scheduling precedence-constrained scientific applications on ...
We consider online job scheduling together with power management on multiple machines. In this model...
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can s...
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...
We consider offline scheduling algorithms that incorporate speed scaling to address the bi-criteria ...
We consider the bi-criteria problem of minimizing the average flow time (average response time) of a...
We consider the bi-criteria problem of minimizing the average flow time (average response time) of a...
Topic classification: Algorithms and data structures We study scheduling problems in battery-operate...
International audienceWe consider the problem of allocating a large number of independent, equal-siz...
International audienceMultiple applications that execute concurrently on heterogeneous platforms com...
Streaming applications have become increasingly important and widespread,with application domains ra...
Abstract. Scheduling algorithms for shared platforms such as grids and clouds granted users of diffe...
Online flow-time scheduling is a fundamental problem in computer science and has been extensively st...
peer reviewedWe address the problem of scheduling precedence-constrained scientific applications on ...
We consider online job scheduling together with power management on multiple machines. In this model...
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can s...
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...
We consider offline scheduling algorithms that incorporate speed scaling to address the bi-criteria ...
We consider the bi-criteria problem of minimizing the average flow time (average response time) of a...
We consider the bi-criteria problem of minimizing the average flow time (average response time) of a...
Topic classification: Algorithms and data structures We study scheduling problems in battery-operate...
International audienceWe consider the problem of allocating a large number of independent, equal-siz...
International audienceMultiple applications that execute concurrently on heterogeneous platforms com...
Streaming applications have become increasingly important and widespread,with application domains ra...
Abstract. Scheduling algorithms for shared platforms such as grids and clouds granted users of diffe...
Online flow-time scheduling is a fundamental problem in computer science and has been extensively st...
peer reviewedWe address the problem of scheduling precedence-constrained scientific applications on ...
We consider online job scheduling together with power management on multiple machines. In this model...
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can s...