DMCA
A.: The bell is ringing in speed-scaled multiprocessor scheduling (2009)
| Venue: | In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA |
| Citations: | 20 - 0 self |
BibTeX
@INPROCEEDINGS{Greiner09a.:the,
author = {Gero Greiner and Tim Nonner and Er Souza and Albert Ludwigs},
title = {A.: The bell is ringing in speed-scaled multiprocessor scheduling},
booktitle = {In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA},
year = {2009},
pages = {11--18}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper investigates the problem of scheduling jobs on multiple speedscaled processors without migration, i.e., we have constant α> 1 such that running a processor at speed s results in energy consumption s α per time unit. We consider the general case where each job has a monotonously increasing cost function that penalizes delay. This includes the so far considered cases of deadlines and flow time. For any type of delay cost functions, we obtain the following results: Any β-approximation algorithm for a single processor yields a randomized βBα-approximation algorithm for multiple processors without migration, where Bα is the αth Bell number, that is, the number of partitions of a set of size α. Analogously, we show that any β-competitive online algorithm for a single processor yields a βBα-competitive online algorithm for multiple processors without migration. Finally, we show that any β-approximation algorithm for multiple processors with migration yields a deterministic βBα-approximation algorithm for multiple processors without migration. These facts improve several approximation ratios and lead to new results. For instance, we obtain the first constant factor online and offline approximation algorithm for multiple processors without migration for arbitrary release times, deadlines, and job sizes.
Keyphrases
multiple processor speed-scaled multiprocessor scheduling approximation algorithm single processor yield competitive online algorithm energy consumption th bell number following result speed result migration yield delay cost function job size randomized approximation algorithm new result offline approximation algorithm flow time arbitrary release time time unit first constant factor online general case cost function several approximation ratio deterministic approximation algorithm
