Abstract
We study the online scheduling problem of maximising job completion subject to temperature constraints. In our setting, jobs are of equal length and have deadlines and heat contributions. The algorithm tries to complete as many jobs as possible before their deadlines while keeping the temperature of the system within an acceptable limit. We give an optimal algorithm for the case where preemption is not allowed. Then we consider the case of preemption and prove a number of lower bounds, showing that for many combination of system parameters, preemption (with restart) is not helpful in improving the competitiveness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic speed scaling to manage energy and temperature. In: Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 520–529 (2004)
Baruah, S.K., Haritsa, J.R., Sharma, N.: On-line scheduling to maximize task completions. In: Proc. 15th IEEE Real-Time Systems Symposium, pp. 228–236 (1994)
Birks, M., Fung, S.P.Y.: Temperature aware online scheduling with a low cooling factor. In: Proc. 7th Int. Conference on Theory and Applications of Models of Computation, pp. 105–116 (2010)
Chrobak, M., Dürr, C., Hurand, M., Robert, J.: Algorithms for temperature-aware task scheduling in microprocessor systems. In: Proc. 4th Int. Conference on Algorithmic Aspects in Information and Management, pp. 120–130 (2008)
Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput. 36(6), 1709–1728 (2007)
Coskun, A.K., Rosing, T.S., Whisnant, K.: Temperature aware task scheduling in MPSoCs. In: Proc. of 2007 Design, Automation and Test in Europe Conference, pp. 1659–1664 (2007)
Goldman, S.A., Parwatikar, J., Suri, S.: Online scheduling with hard deadlines. J. Algorithms 34(2), 370–389 (2000)
Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters 27(5), 193–197 (2000)
Irani, S., Pruhs, K.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Birks, M., Fung, S.P.Y. (2011). Temperature Aware Online Algorithms for Scheduling Equal Length Jobs. In: Atallah, M., Li, XY., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 6681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21204-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-21204-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21203-1
Online ISBN: 978-3-642-21204-8
eBook Packages: Computer ScienceComputer Science (R0)