We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works) on parallel speed scalable processors so as to minimize the total energy consumption. We consider that both preemptions and migrations of jobs are allowed. For this problem, there exists an optimal polynomial-time algorithm which uses as a black box an algorithm for linear programming. Here, we formulate the problem as a convex program and we propose a combinatorial polynomial-time algorithm which is based on finding maximum flows. Our algorithm runs in O(nf(n)logU) time, where n is the number of jobs, U is the range of all possible values of processors’ speeds divided by the desired accuracy and f(n) is the time needed for ...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
Abstract: We consider energy-efficient scheduling on multiprocessors, where the speed of each proces...
International audienceWe consider a task graph to be executed on a set of processors. We assume that...
We study the problem of scheduling a set of jobs with release dates, deadlines and processing requir...
International audienceRecently, optimal combinatorial algorithms have been presented for the energy ...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
In this paper we investigate algorithmic instruments leading to low power consumption in computing d...
International audienceIn the classical energy minimization problem, introduced in [24], we are given...
We are given a set of n jobs that have to be executed on a set of m speed-scalable machines that can...
Nowadays, the energy consumption and the heat dissipation of computing environmentshave emerged as c...
We are given a set of n jobs and a single processor that can vary its speed dynamically. Each job J_...
Abstract. We improve complexity bounds for energy-efficient speed scheduling problems for both the s...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
International audienceWe are given a set of jobs, each one specified by its release date, its deadli...
International audienceWe are given a set of jobs, each one specified by its release date, its deadli...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
Abstract: We consider energy-efficient scheduling on multiprocessors, where the speed of each proces...
International audienceWe consider a task graph to be executed on a set of processors. We assume that...
We study the problem of scheduling a set of jobs with release dates, deadlines and processing requir...
International audienceRecently, optimal combinatorial algorithms have been presented for the energy ...
International audienceWe consider the problem of scheduling a set of jobs, each one specified by its...
In this paper we investigate algorithmic instruments leading to low power consumption in computing d...
International audienceIn the classical energy minimization problem, introduced in [24], we are given...
We are given a set of n jobs that have to be executed on a set of m speed-scalable machines that can...
Nowadays, the energy consumption and the heat dissipation of computing environmentshave emerged as c...
We are given a set of n jobs and a single processor that can vary its speed dynamically. Each job J_...
Abstract. We improve complexity bounds for energy-efficient speed scheduling problems for both the s...
International audienceWe are given a set of n jobs and a single processor that can vary its speed dy...
International audienceWe are given a set of jobs, each one specified by its release date, its deadli...
International audienceWe are given a set of jobs, each one specified by its release date, its deadli...
In this paper we study energy efficient deadline scheduling on multiprocessors in which the processo...
Abstract: We consider energy-efficient scheduling on multiprocessors, where the speed of each proces...
International audienceWe consider a task graph to be executed on a set of processors. We assume that...