Energy-aware scheduling : complexity and algorithms

Energy-aware scheduling : complexity and algorithms

Show other versions (1)

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 inde...

Full description

Bibliographic Details
Main Author: Renaud-Goud, Paul
Language:ENG
Published: Ecole normale supérieure de lyon - ENS LYON 2012
Subjects:
[INFO:INFO_OH] Computer Science/Other
Energy minimization
Power
Scheduling
Complexity
Makespan
Heuristics
Optimal algorithms
Greedy algorithm
Independent jobs
Parallel processors
Mapping
Concurrent streaming applications
Heterogeneous platforms
Resource sharing
Energy
Latency
Period
Workflow
Replica placement
Tree networks
Update strategies
Dynamic programming algorithms
Series-parallel graph
Routing
Chip multiprocesseur
Manhattan
Single path
Multiple paths
Slack reclamation
DAG
Online Access:http://tel.archives-ouvertes.fr/tel-00744247
http://tel.archives-ouvertes.fr/docs/00/74/42/47/PDF/RENAUD_GOUD_Paul_2012_These.pdf

Internet

http://tel.archives-ouvertes.fr/tel-00744247
http://tel.archives-ouvertes.fr/docs/00/74/42/47/PDF/RENAUD_GOUD_Paul_2012_These.pdf

Similar Items