Speed Scaling with an Arbitrary Power Function

This article initiates a theoretical investigation into online scheduling problems with speed scaling where the allowable speeds may be discrete, and the power function may be arbitrary, and develops algorithmic analysis techniques for this setting. We show that a natural algorithm, which uses Short...

Full description

Saved in:
Bibliographic Details
Published inACM transactions on algorithms Vol. 9; no. 2; pp. 1 - 14
Main Authors Bansal, Nikhil, Chan, Ho-Leung, Pruhs, Kirk
Format Journal Article
LanguageEnglish
Published 01.03.2013
Subjects
Algorithms
Online AccessGet full text
ISSN1549-6325
1549-6333
DOI10.1145/2438645.2438650

Cover

More Information
Summary:This article initiates a theoretical investigation into online scheduling problems with speed scaling where the allowable speeds may be discrete, and the power function may be arbitrary, and develops algorithmic analysis techniques for this setting. We show that a natural algorithm, which uses Shortest Remaining Processing Time for scheduling and sets the power to be one more than the number of unfinished jobs, is 3-competitive for the objective of total flow time plus energy. We also show that another natural algorithm, which uses Highest Density First for scheduling and sets the power to be the fractional weight of the unfinished jobs, is a 2-competitive algorithm for the objective of fractional weighted flow time plus energy.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1549-6325
1549-6333
DOI:10.1145/2438645.2438650