An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints

Authors Ahmed Abousamra, David P. Bunde, Kirk Pruhs

Thumbnail PDF


  • Filesize: 0.5 MB
  • 22 pages

Document Identifiers

Author Details

Ahmed Abousamra
David P. Bunde
Kirk Pruhs

Cite AsGet BibTex

Ahmed Abousamra, David P. Bunde, and Kirk Pruhs. An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints. In Algorithm Engineering. Dagstuhl Seminar Proceedings, Volume 10261, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


We consider the first, and most well studied, speed scaling problem in the algorithmic literature: where the scheduling quality of service measure is a deadline feasibility constraint, and where the power objective is to minimize the total energy used. Four online algorithms for this problem have been proposed in the algorithmic literature. Based on the best upper bound that can be proved on the competitive ratio, the ranking of the online algorithms from best to worst is: $qOA$, $OA$, $AVR$, $BKP$. As a test case on the effectiveness of competitive analysis to predict the best online algorithm, we report on an experimental ``horse race'' between these algorithms using instances based on web server traces. Our main conclusion is that the ranking of our algorithms based on their performance in our experiments is identical to the order predicted by competitive analysis. This ranking holds over a large range of possible power functions, and even if the power objective is temperature.
  • Scheduling
  • Speed Scaling
  • Experimental Algorithms
  • Power Management


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail