Abstract
We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (works), on parallel speed-scalable processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. We formulate the problem as a convex program and we propose a polynomial-time combinatorial algorithm which is based on a reduction to the maximum flow problem. We extend our algorithm to the multiprocessor speed scaling problem with preemption and migration where the objective is the minimization of the maximum lateness under a budget of energy.
Research supported by the French Agency for Research under the DEFIS program TODO, ANR-09-EMER-010, and by GDR du CNRS, RO.
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
Albers, S.: Energy Efficient Algorithms. Communications of the ACM 53(5), 86–96 (2010)
Albers, S.: Algorithms for Dynamic Speed Scaling. In: STACS. LIPIcs, vol. 9, pp. 1–11 (2011)
Albers, S., Antoniadis, A., Greiner, G.: On Multi-Processor Speed Scaling with Migration. In: SPAA, pp. 279–288 (2011)
Albers, S., Muller, F., Schmelzer, S.: Speed Scaling on Parallel Processors. In: SPAA, pp. 289–298 (2007)
Bansal, N., Kimbrel, T., Pruhs, K.: Speed Scaling to Manage Energy and Temperature. Journal of the ACM 54(1), 3 (2007)
Baptiste, P., Néron, E., Sourd, F.: Modèles et Algorithmes en Ordonnancement. Ellipses (2004)
Bingham, B., Greenstreet, M.: Energy Optimal Scheduling on Multiprocessors with Migration. In: ISPA, pp. 153–161 (2008)
Chen, J.J., Hsu, H.R., Chuang, K.H., Yang, C.L., Pang, A.C., Kuo, T.W.: Multiprocessor Energy Efficient Scheduling with Task Migration Considerations. In: ECRTS, pp. 101–108 (2004)
Greiner, G., Nonner, T., Souza, A.: The Bell is Ringing in Speed Scaled Multiprocessor Scheduling. In: SPAA, pp. 11–18 (2009)
Nemirovski, A., Nesterov, I., Nesterov, Y.: Interior Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (1994)
Yao, F., Demers, A., Shenker, S.: A Scheduling Model for Reduced CPU Energy. In: FOCS, pp. 374–382 (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
Angel, E., Bampis, E., Kacem, F., Letsios, D. (2012). Speed Scaling on Parallel Processors with Migration. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-32820-6_15
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)