Skip to Main content Skip to Navigation

Energy-aware scheduling : complexity and algorithms

Paul Renaud-Goud 1, 2 
Abstract : In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third chapter, we study the replica placement problem in a tree network. We try to minimize the energy consumption in a dynamic frame. After a complexity study, we confirm the quality of our heuristics through a complete set of simulations. In the fourth chapter, we come back to streaming applications, but in the form of series-parallel graphs, and try to map them onto a chip multiprocessor. The design of a polynomial algorithm on a simple problem allows us to derive heuristics on the most general problem, whose NP-completeness has been proven. In the fifth chapter, we study energy bounds of different routing policies in chip multiprocessors, compared to the classical XY routing, and develop new routing heuristics. In the last chapter, we compare the performance of different algorithms of the literature that tackle the problem of mapping DAG applications to minimize the energy consumption.
Document type :
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Monday, October 22, 2012 - 3:57:12 PM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Wednesday, January 23, 2013 - 3:43:01 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00744247, version 1


Paul Renaud-Goud. Energy-aware scheduling : complexity and algorithms. Other [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2012. English. ⟨NNT : 2012ENSL0727⟩. ⟨tel-00744247⟩



Record views


Files downloads