A realistic variable voltage scheduling model for real-time applications
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Optimal voltage allocation techniques for dynamically variable voltage processors
Proceedings of the 40th annual Design Automation Conference
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On energy-optimal voltage scheduling for fixed-priority hard real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
Dynamic voltage scaling for systemwide energy minimization in real-time embedded systems
Proceedings of the 2004 international symposium on Low power electronics and design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Journal of Computer and System Sciences
Algorithmic problems in power management
ACM SIGACT News
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Getting the best response for your erg
ACM Transactions on Algorithms (TALG)
Competitive non-migratory scheduling for flow time and energy
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Online deadline scheduling with bounded energy efficiency
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Routing for energy minimization in the speed scaling model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Speed scaling of tasks with precedence constraints
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
An efficient algorithm for computing optimal discrete voltage schedules
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
Rate-adaptive weighted fair queueing for energy-aware scheduling
Information Processing Letters
| Hi-index | 0.00 |
We study job scheduling on processors capable of running at variable voltage/speed to minimize energy consumption. Each job in a problem instance is specified by its arrival time and deadline, together with required number of CPU cycles. It is known that the minimum energy schedule for n jobs can be computed in O(n3) time, assuming a convex energy function. We investigate more efficient algorithms for computing the optimal schedule when the job sets have certain special structures. When the time intervals are structured as trees, the minimum energy schedule is shown to have a succinct characterization and is computable in time O(P) where P is the tree’s total path length. We also study an on-line average-rate heuristics AVR and prove that its energy consumption achieves a small constant competitive ratio for nested job sets and for job sets with limited overlap. Some simulation results are also given.