Nonclairvoyant Speed Scaling for Flow and Energy
Data Structures and Algorithms
2009-02-10 v1
Abstract
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P (s) = s\^\propto. We give a nonclairvoyant algorithm that is shown to be O(\propto\^3)-competitive. We then show an \Omega(\propto\^(1/3-\epsilon)) lower bound on the competitive ratio of any nonclairvoyant algorithm. We also show that there are power functions for which no nonclairvoyant algorithm can be O(1)-competitive.
Cite
@article{arxiv.0902.1260,
title = {Nonclairvoyant Speed Scaling for Flow and Energy},
author = {Ho-Leung Chan and Jeff Edmonds and Tak-Wah Lam and Lap-Kei Lee and Alberto Marchetti-Spaccamela and Kirk Pruhs},
journal= {arXiv preprint arXiv:0902.1260},
year = {2009}
}