Article thumbnail

Speed scaling with a solar cell

By N Nikhil Bansal, HL Chan and KR Pruhs

Abstract

We consider the speed scaling problem of scheduling a collection of tasks with release times, deadlines, and sizes so as to minimize the energy recharge rate. This is the first theoretical investigation of speed scaling for devices with a regenerative energy source. We show that the problem can be expressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a schedule. We show that the energy optimal YDS schedule, is 2-approximate with respect to the recharge rate. We show that the online algorithm BKP is O(1)-competitive with respect to recharge rate

Publisher: 'Springer Fachmedien Wiesbaden GmbH'
Year: 2008
OAI identifier: oai:library.tue.nl:694908
Provided by: Repository TU/e
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://repository.tue.nl/69490... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.