A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Windows Scheduling Problems for Broadcast Systems
SIAM Journal on Computing
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Windows scheduling of arbitrary length jobs on parallel machines
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Energy-Efficient broadcast scheduling for speed-controlled transmission channels
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
A server repeatedly transmits data items (pages) possibly with different speeds on a set of channels. The objective is to minimize energy consumption of the schedule. We adopt the common model that sending at speed s for t time units consumes t ċ sα energy for a constant α ≥ 2. An individual window length is associated with each page. This length is a strict upper bound on the time between two consecutive broadcasts for that page. We present an easy to implement algorithm for the single channel case that obtains an approximation ratio of 3 ċ 4α. For the multi-channel case with identical channels an extension of this algorithm computes an 8α-approximation. Both algorithms run in low-order polynomial time. As our main tool for the analysis, we show that it suffices to consider periodic schedules as their energy density (total energy consumption per time unit) differs from the one of general schedules at most by (1 + Ɛ) for an arbitrary constant Ɛ 0.