Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
The algebraic degree of geometric optimization problems
Discrete & Computational Geometry
Reducing power in high-performance microprocessors
DAC '98 Proceedings of the 35th annual Design Automation Conference
Approximation schemes for scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Energy-efficient packet transmission over a wireless link
IEEE/ACM Transactions on Networking (TON)
Compile-time dynamic voltage scaling settings: opportunities and limits
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Pre-Emptive Scheduling Problems with Controllable Processing Times
Journal of Scheduling
Algorithmic problems in power management
ACM SIGACT News
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Single machine scheduling with controllable release and processing parameters
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Scheduling for reduced CPU energy
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Power-saving scheduling for weakly dynamic voltage scaling devices
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On adaptive transmission for energy efficiency in wireless data networks
IEEE Transactions on Information Theory
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
Assigning real-time tasks to heterogeneous processors by applying ant colony optimization
Journal of Parallel and Distributed Computing
A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems
Journal of Parallel and Distributed Computing
Improved multi-processor scheduling for flow time and energy
Journal of Scheduling
The Journal of Supercomputing
Power-aware speed scaling in processor sharing systems: Optimality and robustness
Performance Evaluation
Fast assessment of production makespan using aggregate technical data
Computers in Industry
Parallel-machine scheduling to minimize tardiness penalty and power cost
Computers and Industrial Engineering
Multi-objective energy aware multiprocessor scheduling using bat intelligence
Journal of Intelligent Manufacturing
| Hi-index | 0.00 |
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give a linear-time algorithm to compute all non-dominated solutions for the general uniprocessor problem and a fast arbitrarily-good approximation for multiprocessor problems when every job requires the same amount of work. We also show that the multiprocessor problem becomes NP-hard when jobs can require different amounts of work.For total flow, we show that the optimal flow corresponding to a particular energy budget cannot be exactly computed on a machine supporting exact real arithmetic, including the extraction of roots. This hardness result holds even when scheduling equal-work jobs on a uniprocessor. We do, however, extend previous work by Pruhs et al. to give an arbitrarily-good approximation for scheduling equal-work jobs on a multiprocessor.