Scheduling on power-heterogeneous processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2017

Scheduling on power-heterogeneous processors


We consider the problem of scheduling a set of jobs, each one specified by its release date, its deadline and its processing volume, on a set of heterogeneous speed-scalable processors, where the energy-consumption rate is processor-dependent. Our objective is to minimize the total energy consumption when both the preemption and the migration of jobs are allowed. We propose a new algorithm based on a compact linear programming formulation. Our method approaches the value of the optimal solution within any desired accuracy for a large set of continuous power functions. Furthermore, we develop a faster combinatorial algorithm based on flows for standard power functions and jobs whose density is lower bounded by a small constant. Finally, we extend and analyze the AVerage Rate (AVR) online algorithm in the heterogeneous setting.
Fichier principal
Vignette du fichier
journal.pdf (328.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01668736 , version 1 (07-03-2018)



Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz. Scheduling on power-heterogeneous processors. Information and Computation, 2017, 257, pp.22-33. ⟨10.1016/j.ic.2017.09.013⟩. ⟨hal-01668736⟩
397 View
220 Download



Gmail Facebook Twitter LinkedIn More