Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
Online computation and competitive analysis
Online computation and competitive analysis
Dynamic power management based on continuous-time Markov decision processes
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Dynamic power management of complex systems using generalized stochastic Petri nets
Proceedings of the 37th Annual Design Automation Conference
Quantitative comparison of power management algorithms
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Comparing System-Level Power Management Policies
IEEE Design & Test
The case for power management in web servers
Power aware computing
Proceedings of the conference on Design, automation and test in Europe
Hierarchical Adaptive Dynamic Power Management
IEEE Transactions on Computers
Power-Aware Processor Scheduling under Average Delay Constraints
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Algorithmic problems in power management
ACM SIGACT News
HLDVT '02 Proceedings of the Seventh IEEE International High-Level Design Validation and Test Workshop
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
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
Efficient Algorithms
Optimal speed scaling under arbitrary power functions
ACM SIGMETRICS Performance Evaluation Review
Online deadline scheduling with bounded energy efficiency
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Polynomial time algorithms for minimum energy scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Towards energy-aware scheduling in data centers using machine learning
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Probability, Stochastic Processes, and Queueing Theory: The Mathematics of Computer Performance Modeling
Policy optimization for dynamic power management
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Many computer systems change into a sleep mode when idle. While this conserves energy it also increases the average latency. In this paper we quantify the effect of state change times on latency and power consumption for a single queuing system with a sleep mode. We analyze the trade-off between power consumption and latency for Poisson arrivals and do a competitive analysis for worst-case arrivals. To calculate the latency and power consumption for Poisson arrivals we use a Markov chain. For the competitive analysis we present arrival patterns which result in high latency and energy consumption and prove that these patterns are the worst case. The latency increases approximately linear with the state change times for both Poisson and worst case arrivals. Power consumption asymptotically approaches 100% when the state change times increase. While this is intuitively clear, we provide an analytic derivation. We conclude that a single system with a single sleep mode must have fast state change times to be able to keep the latency low when conserving energy.