Nonclairvoyantly scheduling power-heterogeneous processors

Authors:
Anupam Gupta;Ravishankar Krishnaswamy;Kirk Pruhs
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, USA;Computer Science Department, Carnegie Mellon University, Pittsburgh, USA;Computer Science Department, University of Pittsburgh, USA
Venue:
GREENCOMP '10 Proceedings of the International Conference on Green Computing
Year:
2010

Citing 0
Cited 3

Managing power heterogeneity

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Scheduling heterogeneous processors isn't as easy as you think

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Speed Scaling with an Arbitrary Power Function

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a natural nonclairvoyant online algorithm for scheduling jobs on a power-heterogeneous multiprocessor is bounded-speed bounded-competitive for the objective of flow plus energy.