Abstract
We consider a temperature-aware online deadline scheduling model. The objective is to schedule a number of unit jobs, with release dates, deadlines, weights and heat contributions, to maximize the weighted throughput subject to a temperature threshold. We give an optimal randomized algorithm and another resource-augmented constant-competitive randomized algorithm for the problem. We also give almost tight upper and lower bounds for the multiple processor case.
This is a preview of subscription content, log in via an institution to check access.
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
Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proceedings of 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 761–770 (2003)
Awerbuch, B., Bartal, Y., Fiat, A., Rosen, A.: Competitive non-preemptive call control. In: Proceedings of 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 312–320 (1994)
Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic speed scaling to manage energy and temperature. Journal of the ACMÂ 54(1) (2007)
Birks, M., Fung, S.P.Y.: Temperature aware online scheduling with a low cooling factor. In: KratochvÃl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 105–116. Springer, Heidelberg (2010)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)
Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. Journal of Discrete Algorithms 4(2), 255–276 (2006)
Chin, F.Y.L., Fung, S.P.Y.: Online scheduling with partial job values: Does timesharing or randomization help? Algorithmica 37(3), 149–164 (2003)
Chrobak, M., Dürr, C., Hurand, M., Robert, J.: Algorithms for temperature-aware task scheduling in microprocessor systems. In: Proceedings of 4th International Conference on Algorithmic Aspects in Information and Management, pp. 120–130 (2008)
Coskun, A., Rosing, T., Whisnant, K.: Temperature aware task scheduling in MPSoCs. In: Proc. Conference on Design, Automation and Test in Europe, pp. 1659–1664 (2007)
Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 209–218 (2007)
Yang, J., Zhou, X., Chrobak, M., Zhang, Y., Jin, L.: Dynamic thermal management through task scheduling. In: IEEE International Symposium on Performance Analysis of Systems and Software, pp. 191–201 (2008)
Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of 18th IEEE Symposium on Foundations of Computer Science, pp. 222–227 (1977)
Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of 36th IEEE Symposium on Foundations of Computer Science, pp. 374–382 (1995)
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., Cole, D., Fung, S.P.Y., Xue, H. (2011). Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints. 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_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-21204-8_34
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)