Speed Scaling with a Solar Cell

We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. 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 of the regenerative source. 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 show 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.

• Type: Conference
• Year: 2008
• Where: AAIM
• Authors: Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
• Keywords: AAIM 2008, Algorithms, Energy Recharge Rate, Recharge Rate, Regenerative Source