Speed scaling to manage energy and temperature
Journal of the ACM (JACM)
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional DSP
Journal of Parallel and Distributed Computing
Speed Scaling with a Solar Cell
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Speed scaling with a solar cell
Theoretical Computer Science
Optimizing throughput and energy in online deadline scheduling
ACM Transactions on Algorithms (TALG)
Energy optimal schedules for jobs with multiple active intervals
Theoretical Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Min-Energy Scheduling for Aligned Jobs in Accelerate Model
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Communications of the ACM
Energy-Efficient Considerations on a Variable-Bitrate PCI-Express Device
Journal of Signal Processing Systems
Online deadline scheduling with bounded energy efficiency
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Transition-aware DVS algorithm for real-time systems using tree structure analysis
Journal of Systems Architecture: the EUROMICRO Journal
Online energy-saving algorithm for sensor networks in dynamic changing environments
Journal of Embedded Computing
How to schedule when you have to buy your energy
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Min-energy scheduling for aligned jobs in accelerate model
Theoretical Computer Science
On multi-processor speed scaling with migration: extended abstract
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science
Approximation algorithms for unrelated machine scheduling with an energy budget
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Power efficient rate monotonic scheduling for multi-core systems
Journal of Parallel and Distributed Computing
Race to idle: new algorithms for speed scaling with a sleep state
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Energy efficient scheduling of parallel tasks on multiprocessor computers
The Journal of Supercomputing
Polynomial-time algorithms for minimum energy scheduling
ACM Transactions on Algorithms (TALG)
The Journal of Supercomputing
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Energy-efficient deadline scheduling for heterogeneous systems
Journal of Parallel and Distributed Computing
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Speed Scaling with an Arbitrary Power Function
ACM Transactions on Algorithms (TALG)
Journal of Scheduling
Race to idle: New algorithms for speed scaling with a sleep state
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.02 |
We consider the problem of job scheduling on a variable voltage processor with $d$ discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for $n$ jobs in $O(d n\log n)$ time. Previous approaches solve this problem by first computing the optimal continuous solution in $O(n^3)$ time and then adjusting the speed to discrete levels. In our approach, the optimal discrete solution is characterized and computed directly from the inputs. We also show that $O(n\log n)$ time is required; hence the algorithm is optimal for fixed $d$.