Makespan Minimization for Parallel Jobs with Energy Constraint
- 141 Downloads
We are given a set of parallel jobs that have to be executed on a set of speed-scalable processors varying their speeds dynamically. Running a job at a slower speed is more energy efficient, however it takes longer time and affects the performance. Every job is characterized by the processing volume and the number of the required processors. Our objective is to minimize the maximum completion time so that the energy consumption is not greater than a given energy budget. For various particular cases we propose polynomial-time approximation algorithms, consisting of two stages. At the first stage, we give an auxiliary convex program. By solving this problem in polynomial time, we find processing times of jobs and a lower bound on the makespan. Then, at the second stage, we transform our problem to the classical problem without speed scaling and construct a feasible schedule.
KeywordsParallel job Speed scaling Scheduling Approximation algorithm
- 2.Bampis, E., Letsios, D., Lucarelli, G.: A note on multiprocessor speed scaling with precedence constraints. In: 26th ACM symposium on Parallelism in algorithms and architectures, SPAA 2014, pp. 138–142. ACM (2014)Google Scholar
- 8.Kononov, A., Kovalenko, Y.: On speed scaling scheduling of parallel jobs with preemption. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 309–321. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44914-2_25CrossRefGoogle Scholar
- 9.Kuhn, H., Tucker, A.: Nonlinear programming. In: The Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481–492. University of California Press, Berkeley (1951)Google Scholar
- 12.Nesterov, E.: Methods of Convex Optimization. Moscow (2010). (in Russian)Google Scholar