Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Shelf schedules for independent moldable tasks to minimize the energy consumption

Abstract : 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 of parallel moldable tasks that can decide their degree of parallelism at execution (i.e., 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 should 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, and simulations are performed to show the performance of the proposed algorithms.
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Wednesday, November 24, 2021 - 5:10:12 PM
Last modification on : Wednesday, October 26, 2022 - 8:15:12 AM
Long-term archiving on: : Friday, February 25, 2022 - 7:46:02 PM


Files produced by the author(s)


  • HAL Id : hal-03447266, version 1


Anne Benoit, Louis-Claude Canon, Redouane Elghazi, Pierre-Cyrille Heam. Shelf schedules for independent moldable tasks to minimize the energy consumption. [Research Report] RR-9436, Institut National de Recherche en Informatique et en Automatique (INRIA). 2021, pp.19. ⟨hal-03447266⟩



Record views


Files downloads