A note on multiprocessor speed scaling with precedence constraints

Evripidis Bampis 1 Dimitrios Letsios Giorgio Lucarelli 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We consider the problem of scheduling a set of jobs, under precedence constraints, on a set of speed scalable parallel processors. The goal is to minimize the makespan of the schedule, i.e. the time at which the last job finishes its execution, without violating a given energy budget. This situation finds applications in computer devices whose lifetime depends on a limited battery efficiency. In order to handle the energy consumption we use the energy model introduced in [Yao et al., FOCS'95], which captures the intuitive idea that the higher is the processor's speed the higher is the energy consumption. We propose a (2-1/m)-approximation algorithm improving the best known poly-log(m)-approximation algorithm for the problem [Pruhs et al., TOCS 2008], where m is the number of the processors. We also extend the simple idea used for the above problem, in order to propose a generalized framework that finds applications to other scheduling problems in the speed scaling setting.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01215576
Contributor : Lip6 Publications <>
Submitted on : Wednesday, October 14, 2015 - 3:01:24 PM
Last modification on : Thursday, March 21, 2019 - 12:58:59 PM

Identifiers

Citation

Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli. A note on multiprocessor speed scaling with precedence constraints. 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2014), Jun 2014, Prague, Czech Republic. pp.138-142, ⟨10.1145/2612669.2612672⟩. ⟨hal-01215576⟩

Share

Metrics

Record views

87