Speed Scaling with an Arbitrary Power Function

Authors:
Nikhil Bansal;Ho-Leung Chan;Kirk Pruhs
Affiliations:
Eindhoven University of Technology;The University of Hong Kong;University of Pittsburgh
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2013

Citing 12
Cited 1

An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

SIAM Journal on Computing
Competitive online scheduling for server systems

ACM SIGMETRICS Performance Evaluation Review
Speed scaling for weighted flow time

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Energy-efficient algorithms for flow time minimization

ACM Transactions on Algorithms (TALG)
Getting the best response for your erg

ACM Transactions on Algorithms (TALG)
Scheduling for Speed Bounded Processors

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Impact of Dynamically Heterogeneous Multicore Processors on Thread Scheduling

IEEE Micro
Weighted flow time does not admit O(1)-competitive algorithms

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal speed scaling under arbitrary power functions

ACM SIGMETRICS Performance Evaluation Review
Scalably scheduling power-heterogeneous processors

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Nonclairvoyantly scheduling power-heterogeneous processors

GREENCOMP '10 Proceedings of the International Conference on Green Computing

Race to idle: New algorithms for speed scaling with a sleep state

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.