Optimal Speed Scaling with a Solar Cell
We consider the setting of a sensor that consists of a speed-scalable processor, a battery, and a solar cell that harvests energy from its environment at a time-invariant recharge rate. The processor must process a collection of jobs of various sizes. Jobs arrive at different times and have different deadlines. The objective is to minimize the recharge rate, which is the rate at which the device has to harvest energy in order to feasibly schedule all jobs. The main result is a polynomial-time combinatorial algorithm for processors with a natural set of discrete speed/power pairs.
- 2.Antoniadis, A., Barcelo, N., Consuegra, M.E., Kling, P., Nugent, M., Pruhs, K., Scquizzato, M.: Efficient computation of optimal energy and fractional weighted flow trade-off schedules. In: Symposium on Theoretical Aspects of Computer Science, pp. 63–74 (2014)Google Scholar
- 5.Barcelo, N., Kling, P., Nugent, M., Pruhs, K.: Optimal speed scaling with a solar cell. arXiv:1609.02668 [cs.DS]
- 7.Cole, D., Letsios, D., Nugent, M., Pruhs, K.: Optimal energy trade-off schedules. In: International Green Computing Conference, pp. 1–10 (2012)Google Scholar
- 12.Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: Foundations of Computer Science, pp. 374–382 (1995)Google Scholar