2026-07-19T19:49:11Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1815 2024-03-06T10:33:10Z ddc:004 open_access

Nonclairvoyant Speed Scaling for Flow and Energy Chan, Ho-Leung Edmonds, Jeff Lam, Tak-Wah Lee, Lap-Kei Marchetti-Spaccamela, Alberto Pruhs, Kirk 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^\alpha$. We give a nonclairvoyant algorithm that is shown to be $O(\alpha^3)$-competitive. We then show an $\Omega( \alpha^{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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ho-Leung Chan and Jeff Edmonds and Tak-Wah Lam and Lap-Kei Lee and Alberto Marchetti-Spaccamela and Kirk Pruhs 2009 Is Part Of LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2009.1815 urn:nbn:de:0030-drops-18151 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1815 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode