A static power model for architects
Proceedings of the 33rd annual ACM/IEEE international symposium on Microarchitecture
Process variation aware cache leakage management
Proceedings of the 2006 international symposium on Low power electronics and design
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Power provisioning for a warehouse-sized computer
Proceedings of the 34th annual international symposium on Computer architecture
Speed scaling for weighted flow time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling for Speed Bounded Processors
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Weighted flow time does not admit O(1)-competitive algorithms
SODA '09 Proceedings of the twentieth 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
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Optimal speed scaling under arbitrary power functions
ACM SIGMETRICS Performance Evaluation Review
Energy optimal schedules for jobs with multiple active intervals
Theoretical Computer Science
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
Optimality, fairness, and robustness in speed scaling designs
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Deadline scheduling and power management for speed bounded processors
Theoretical Computer Science
Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
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
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
Non-clairvoyant speed scaling for weighted flow time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Min-energy scheduling for aligned jobs in accelerate model
Theoretical Computer Science
Tradeoff between energy and throughput for online deadline scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Speed Scaling for Weighted Flow Time
SIAM Journal on Computing
Energy-efficient due date scheduling
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Speed scaling for energy and performance with instantaneous parallelism
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Sleep management on multiple machines for energy and flow time
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Resource augmentation for weighted flow-time explained by dual fitting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Scheduling heterogeneous processors isn't as easy as you think
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Race to idle: new algorithms for speed scaling with a sleep state
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Modeling and analyzing power management policies in server farms using stochastic Petri nets
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Non-clairvoyant weighted flow time scheduling with rejection penalty
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Energy-Efficient network routing with discrete cost functions
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Power-aware speed scaling in processor sharing systems: Optimality and robustness
Performance Evaluation
Scheduling for weighted flow time and energy with rejection penalty
Theoretical Computer Science
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Speed-Scaling-based Job/Tasks Deployment for Energy-efficient Datacenters in Cloud Computing
Proceedings of the Second International Conference on Innovative Computing and Cloud Computing
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
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 |
All of the theoretical speed scaling research to date has assumed that the power function, which expresses the power consumption P as a function of the processor speed s, is of the form P = sα, where α 1 is some constant. Motivated in part by technological advances, we initiate a study of speed scaling with arbitrary power functions. We consider the problem of minimizing the total flow plus energy. Our main result is a (3+ε)-competitive algorithm for this problem, that holds for essentially any power function. We also give a (2+ε)-competitive algorithm for the objective of fractional weighted flow plus energy. Even for power functions of the form sα, it was not previously known how to obtain competitiveness independent of α for these problems. We also introduce a model of allowable speeds that generalizes all known models in the literature.