DMCA
Power-aware scheduling for makespan and flow (2006)
| Venue: | In Proc. 18th Annual ACM Symp. Parallelism in Algorithms and Architectures |
| Citations: | 42 - 1 self |
BibTeX
@INPROCEEDINGS{Bunde06power-awarescheduling,
author = {David P. Bunde},
title = {Power-aware scheduling for makespan and flow},
booktitle = {In Proc. 18th Annual ACM Symp. Parallelism in Algorithms and Architectures},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We consider offline scheduling algorithms that incorporate speed scaling to address the bi-criteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give a linear-time algorithm to compute all non-dominated solutions for the general uniprocessor problem and a fast arbitrarily-good approximation for multiprocessor problems when every job requires the same amount of work. We also show that the multiprocessor problem becomes NP-hard when jobs can require different amounts of work. For total flow, we show that the optimal flow corresponding to a particular energy bud-get cannot be exactly computed on a machine supporting exact real arithmetic, including the extraction of roots. This hardness result holds even when scheduling equal-work jobs on a uniprocessor. We do, however, extend previous work by Pruhs et al. to give an arbitrarily-good approximation for scheduling equal-work jobs on a multiprocessor. 1
Keyphrases
power-aware scheduling multiprocessor problem equal-work job bi-criteria problem hardness result fast arbitrarily-good approximation arbitrarily-good approximation previous work linear-time algorithm offline scheduling algorithm general uniprocessor problem different amount non-dominated solution particular energy bud-get cannot optimal flow energy consumption total flow
