Abstract
We study a temperature-aware scheduling problem aiming in maximizing the throughput of a set of unit-length jobs, each one having its own heat contribution, on a single processor operating under a strict temperature threshold. Following a simplified model for the processor’s thermal behavior, proposed by Chrobak et al.[9], we analyze the approximation factor of the natural CoolestFirst scheduling algorithm for jobs with common release dates and deadlines. We first prove a \(\frac{k}{k+1}\) factor, where k depends on a partition of the jobs according to their heat contributions. Next, we refine our partition and provide a linear program that shows a lower bound of 0.72 on the approximation factor.
This work was partially supported by the Basic Research Funding Program of the Athens University of Economics and Business (C. Dürr, I. Milis, G. Zois) and by the European Social Fund and Greek national resources under the programs HERACLEITUS II (G. Zois) and THALES-ALGONOW (I. Milis).
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
Albers, S.: Energy-efficient algorithms. Communications of ACM 53(5), 86–96 (2010)
Albers, S.: Algorithms for dynamic speed scaling. In: Symposium on Theoretical Aspects of Computer Science (STACS), pp. 1–11 (2011)
Atkins, L., Aupy, G., Cole, D., Pruhs, K.: Speed scaling to manage temperature. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 9–20. Springer, Heidelberg (2011)
Bampis, E., Letsios, D., Lucarelli, G., Markakis, E., Milis, I.: On multiprocessor temperature-aware scheduling problems. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM-FAW 2012. LNCS, vol. 7285, pp. 149–160. Springer, Heidelberg (2012)
Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. Journal of the ACM 54(1) (2007)
Birks, M., Cole, D., Fung, S.P.Y., Xue, H.: Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 319–329. Springer, Heidelberg (2011)
Birks, M., Fung, S.P.Y.: Temperature aware online algorithms for scheduling equal length jobs. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 330–342. Springer, Heidelberg (2011)
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)
Chrobak, M., Dürr, C., Hurand, M., Robert, J.: Algorithms for temperature-aware task scheduling in microprocessor systems. Sustainable Computing: Informatics and Systems 1(3), 241–247 (2011)
Irani, S., Pruhs, K.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005)
Zhang, S., Chatha, K.S.: Approximation algorithm for the temperature-aware scheduling problem. In: IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pp. 281–288 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dürr, C., Milis, I., Robert, J., Zois, G. (2013). Approximating the Throughput by Coolest First Scheduling. In: Erlebach, T., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2012. Lecture Notes in Computer Science, vol 7846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38016-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-38016-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38015-0
Online ISBN: 978-3-642-38016-7
eBook Packages: Computer ScienceComputer Science (R0)