Abstract
We give an efficient algorithm for solving the following scheduling problem to optimality: Assign n jobs to m processors such that they all meet a common deadline T and energy consumption is minimized by appropriately controlling the clock frequencies of the processors. Jobs are malleable, i.e., their amount of parallelism can be flexibly adapted. In contrast to previous work on energy efficient scheduling we allow more realistic energy consumption functions including a minimum and maximum clock frequency and a linear term in energy consumption. We need certain assumptions on the speedup function of the jobs that we show to apply for a large class of practically occurring functions.
Chapter PDF
Similar content being viewed by others
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.
References
Blazewicz, J., Kovalyov, M.Y., Machowiak, M., Trystram, D., Weglarz, J.: Preemptable malleable task scheduling problem. IEEE Transactions on Computers 55 (2006)
Blazewicz, J., Machowiak, M., Weglarz, J., Kovalyov, M.Y., Trystram, D.: Scheduling malleable tasks on parallel processors to minimize the makespan: Models and algorithms for planning and scheduling problems. Annals of Operations Research 129 (2004)
Chen, J.-J., Kuo, T.-W.: Multiprocessor energy-efficient scheduling for real-time tasks with different power characteristics. In: International Conference on Parallel Processing, ICPP 2005 (2005)
Leung, J.Y.-T. (ed.): Handbook of Scheduling. CRC (2004)
McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6(1) (1959)
Sanders, P., Speck, J.: Efficient parallel scheduling of malleable tasks. In: 2011 IEEE International Parallel Distributed Processing Symposium, IPDPS (2011)
Yang, C.-Y., Chen, J.-J., Kuo, T.-W.: An approximation algorithm for energy-efficient scheduling on a chip multiprocessor. In: Proceedings of the Conference on Design, Automation and Test in Europe, DATE 2005, vol. 1 (2005)
Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced cpu energy. In: Annual Symposium on Foundations of Computer Science, pp. 374–382. IEEE Computer Society (1995)
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
Sanders, P., Speck, J. (2012). Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds) Euro-Par 2012 Parallel Processing. Euro-Par 2012. Lecture Notes in Computer Science, vol 7484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32820-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-32820-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32819-0
Online ISBN: 978-3-642-32820-6
eBook Packages: Computer ScienceComputer Science (R0)