IEEE/ACM Transactions on Networking (TON)
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Online strategies for dynamic power management in systems with multiple power-saving states
ACM Transactions on Embedded Computing Systems (TECS)
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithmic problems in power management
ACM SIGACT News
Speed scaling to manage energy and temperature
Journal of the ACM (JACM)
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR)
IEEE Transactions on Computers
Reducing network energy consumption via sleeping and rate-adaptation
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Routing and scheduling for energy and delay minimization in the powerdown model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Min-energy voltage allocation for tree-structured tasks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.89 |
In this paper we study energy-aware scheduling that trades energy consumption against a traditional performance measure of delay. We use the power-rate function f(x)=c+x^@a for x0 and f(0)=0 to model the power consumption, where c0 represents the base power. We give a definition of a rate-adaptive version of the Weighted Fair Queueing scheduling algorithm, and prove its energy consumption is within a bounded factor of the best possible when the algorithm guarantees the classic end-to-end delay for every connection.