Greedy Minimum-Energy Scheduling
Gunther Bidlingmaier

TL;DR
This paper presents a greedy scheduling algorithm for energy-efficient job scheduling on multiple processors with power-down features, providing a bounded approximation ratio and analyzing its computational complexity.
Contribution
It generalizes a known greedy algorithm from single to multiple processors, establishing energy cost bounds and analyzing algorithm complexity.
Findings
Energy costs are bounded by 2 times the optimal plus processing volume P.
The algorithm runs in O(nf log d) time, with f being max flow computation time.
The approach extends single-processor greedy strategies to multi-processor scenarios.
Abstract
We consider the problem of energy-efficient scheduling across multiple processors with a power-down mechanism. In this setting a set of jobs with individual release times, deadlines, and processing volumes must be scheduled across parallel processors while minimizing the consumed energy. Idle processors can be turned off to save energy, while turning them on requires a fixed amount of energy. For the special case of a single processor, the greedy Left-to-Right algorithm guarantees an approximation factor of . We generalize this simple greedy policy to the case of processors running in parallel and show that the energy costs are still bounded by , where is the energy consumed by an optimal solution and is the total processing volume. Our algorithm has a running time of , where is the…
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.
Taxonomy
TopicsOptimization and Search Problems · Parallel Computing and Optimization Techniques · Scheduling and Optimization Algorithms
