SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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)
Profit-driven uniprocessor scheduling with energy and timing constraints
Proceedings of the 2004 ACM symposium on Applied computing
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
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Speed scaling of tasks with precedence constraints
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Min-energy voltage allocation for tree-structured tasks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Speed scaling to manage temperature
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Power-saving scheduling for weakly dynamic voltage scaling devices
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Proceedings of the 6th ACM conference on Computing frontiers
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
The bell is ringing in speed-scaled multiprocessor scheduling
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Optimizing throughput and energy in online deadline scheduling
ACM Transactions on Algorithms (TALG)
Communications of the ACM
Optimality analysis of energy-performance trade-off for server farm management
Performance Evaluation
Scalably scheduling power-heterogeneous processors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Speed Scaling for Weighted Flow Time
SIAM Journal on Computing
Towards more effective utilization of computer systems
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Improved multi-processor scheduling for flow time and energy
Journal of Scheduling
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Power-aware speed scaling in processor sharing systems: Optimality and robustness
Performance Evaluation
Speed Scaling with an Arbitrary Power Function
ACM Transactions on Algorithms (TALG)
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Journal of Combinatorial Optimization
Dual techniques for scheduling on a machine with varying speed
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Energy-efficient scheduling in multi-core servers
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
Theory of Computing Systems
Hi-index | 0.02 |
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an algorithmic approach in which an energy optimal schedule is computed for a huge A, and then the energy optimal schedule is maintained as A decreases. We show that this approach yields an efficient algorithm for equi-work jobs. We note that the energy optimal schedule has the surprising feature that the job speeds are not monotone functions of the available energy. We then explain why this algorithmic approach is problematic for arbitrary work jobs. Finally, we explain how to use the algorithm for equi-work jobs to obtain an algorithm for arbitrary work jobs that is O(1)-approximate with respect to average response time, given an additional factor of (1 + ε) energy.