A note on multiprocessor speed scaling with precedence constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

A note on multiprocessor speed scaling with precedence constraints

Evripidis Bampis
  • Function : Author
  • PersonId : 855947
Dimitrios Letsios
  • Function : Author
Giorgio Lucarelli


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.
No file

Dates and versions

hal-01215576 , version 1 (14-10-2015)



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⟩
53 View
0 Download



Gmail Facebook X LinkedIn More