Speed scaling of tasks with precedence constraints

  • Authors:
  • Kirk Pruhs;Rob van Stee;Patchrawat Uthaisombut

  • Affiliations:
  • Computer Science Department, University of Pittsburgh, Pittsburgh, PA;Fakultät für Informatik, Universität Karlsruhe, Karlsruhe, Germany;Computer Science Department, University of Pittsburgh, Pittsburgh, PA

  • Venue:
  • WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of speed scaling to conserve energy in a multiprocessor setting where there are precedence constraints between tasks, and where the performance measure is the makespan. That is, we consider an energy bounded version of the classic problem Pm | prec | Cmax. We show that, without loss of generality, one need only consider constant power schedules. We then show how to reduce this problem to the problem Qm | prec | Cmax to obtain a poly-log(m)-approximation algorithm.