Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks

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.

[1]  Tei-Wei Kuo,et al.  An approximation algorithm for energy-efficient scheduling on a chip multiprocessor , 2005, Design, Automation and Test in Europe.

[2]  Jacek Blazewicz,et al.  Preemptable malleable task scheduling problem , 2006, IEEE Transactions on Computers.

[3]  Peter Sanders,et al.  Efficient Parallel Scheduling of Malleable Tasks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[4]  Jacek Blazewicz,et al.  Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan , 2004, Ann. Oper. Res..

[5]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[6]  edited by Jospeh Y-T. Leung,et al.  Handbook of scheduling , 2013 .

[7]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[8]  Tei-Wei Kuo,et al.  Multiprocessor energy-efficient scheduling for real-time tasks with different power characteristics , 2005, 2005 International Conference on Parallel Processing (ICPP'05).