Abstract
We study temperature-aware scheduling problems under the model introduced by Chrobak et al. in [9], where unit-length jobs of given heat contributions are to be scheduled on a set of parallel identical processors. We consider three optimization criteria: makespan, maximum temperature and (weighted) average temperature. On the positive side, we present polynomial time approximation algorithms for the minimization of the makespan and the maximum temperature, as well as, optimal polynomial time algorithms for minimizing the average temperature and the weighted average temperature. On the negative side, we prove that there is no \((\frac{4}{3}-\epsilon)\)-approximation algorithm for the problem of minimizing the makespan for any ε > 0, unless \({\cal P}={\cal NP}\).
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. Commun. ACM 53, 86–96 (2010)
Albers, S.: Algorithms for dynamic speed scaling. In: STACS 2011. LIPIcs, vol. 9. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)
Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1, 55–66 (1998)
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)
Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1), Article 3 (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 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)
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)
Chrobak, M., Dürr, C., Hurand, M., Robert, J.: Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 120–130. Springer, Heidelberg (2008)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416–426 (1969)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144–162 (1987)
Irani, S., Pruhs, K.R.: Algorithmic problems in power management. ACM SIGACT News 36, 63–76 (2005)
Pinedo, M.: Scheduling: Theory, Algorithms and Systems. Prentice-Hall (1995)
Yang, J., Zhou, X., Chrobak, M., Zhang, Y., Jin, L.: Dynamic thermal management through task scheduling. In: ISPASS 2008, pp. 191–201. IEEE Computer Society (2008)
Zhang, S., Chatha, K.S.: Approximation algorithm for the temperature-aware scheduling problem. In: ICCAD 2007, pp. 281–288. IEEE Press (2007)
Zhou, X., Yang, J., Chrobak, M., Zhang, Y.: Performance-aware thermal management via task scheduling. ACM Trans. Archit. Code Optimizat. 7, 1–31 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Letsios, D., Lucarelli, G., Markakis, E., Milis, I. (2012). On Multiprocessor Temperature-Aware Scheduling Problems. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-29700-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29699-4
Online ISBN: 978-3-642-29700-7
eBook Packages: Computer ScienceComputer Science (R0)