Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shen, W., Norrie, D.H.: Agent-based systems for intelligent manufacturing: A state-of-the-art survey. Knowledge and Information Systems 1(2), 129–156 (1999)
Briest, P., Gunia, C.: Energy-efficient broadcast scheduling for speed-controlled transmission channels. In: Proc. of Symp. on Algorithms and Computation (2006)
Krco, S.: Implementation solutions and issues in building a personal sensor network for health care monitoring. In: Proc. of the Special Topic Conference on Information Technology Applications in Biomedicine (2003)
Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic speed scaling to manage energy and temperature. In: Proc. of the Symp. on Foundations of Computer Science (2004)
Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SICOMP: SIAM Journal on Computing 32, 1091–1113 (2003)
Bar-Noy, A., Ladner, R.E., Tamir, T., VanDeGrift, T.: Windows scheduling of arbitrary length jobs on parallel machines. In: Proc. of Symp. on Parallelism in Algorithms and Architectures (2005)
Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced cpu energy. In: Proc. of the Symp. on Foundations of Computer Science (1995)
Chan, H., Chan, W., Lam, T., Lee, L., Mak, K., Wong, P.: Energy efficient online deadline scheduling. In: Proc. of the Symp. on Discrete Algorithms (2007)
Panagiotou, K., Souza, A.: On adequate performance measures for paging. In: Proc. of the Symp. on Theory of Computing (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gunia, C. (2008). Energy-Efficient Windows Scheduling. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-77566-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77565-2
Online ISBN: 978-3-540-77566-9
eBook Packages: Computer ScienceComputer Science (R0)