List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds.

Scheduling independent tasks on a parallel platform is a widely-studied problem, in particular when the goal is to minimize the total execution time, or makespan (P | | C max problem in Graham's notations). Also, many applications do not consist of sequential tasks, but rather parallel tasks, either rigid, with a fixed degree of parallelism, or moldable, with a variable degree of parallelism (i.e., for which we can decide at the execution on how many processors they are executed). Furthermore, since the energy consumption of data centers is a growing concern, both from an environmental and economical point of view, minimizing the energy consumption of a schedule is a main challenge to be addressed. One can then decide, for each task, on how many processors it is executed, and at which speed the processors are operated, with the goal to minimize the total energy consumption. We further focus on co-schedules, where tasks are partitioned into shelves, and we prove that the problem of minimizing the energy consumption remains NP-complete when static energy is consumed during the whole duration of the application. We are however able to provide an optimal algorithm for the schedule within one shelf, i.e., for a set of tasks that start at the same time. Several approximation results are derived, both with discrete and continuous speed models, and extensive simulations are performed to show the performance of the proposed algorithms. • A model for a theoretical analysis of the energy consumption of a schedule for moldable and rigid tasks. • Most presented scheduling problems are NP-complete. • There exist approximation algorithms for the presented problems (from 1.59 to 3 depending on the problem). • An experimental study of the trade-off between the time complexity of the scheduler and the energy consumed by the schedule. [ABSTRACT FROM AUTHOR]