Optimal Speed Scaling with a Solar Cell
Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs

TL;DR
This paper presents a polynomial-time algorithm for scheduling jobs on a speed-scalable processor powered by a solar cell, aiming to minimize the energy recharge rate needed for feasibility.
Contribution
It introduces the first efficient algorithm for optimal speed scaling in solar-powered sensors with discrete speed and power levels.
Findings
Algorithm efficiently computes optimal schedules.
Reduces energy harvesting requirements for sensor operation.
Applicable to systems with discrete speed/power configurations.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
