Energy-aware scheduling on multicore ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
Energy-aware scheduling on multicore heterogeneous grid computing systems
Auteur(s) :
Nesmachnow, Sergio [Auteur]
UDELAR, Facultad de Ingenieria [Montevideo] [UDELAR]
Dorronsoro, Bernabé [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Pecero-Sanchez, Jonathan [Auteur]
Université du Luxembourg [Uni.lu]
Bouvry, Pascal [Auteur]
Université du Luxembourg [Uni.lu]
UDELAR, Facultad de Ingenieria [Montevideo] [UDELAR]
Dorronsoro, Bernabé [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Pecero-Sanchez, Jonathan [Auteur]
Université du Luxembourg [Uni.lu]
Bouvry, Pascal [Auteur]
Université du Luxembourg [Uni.lu]
Titre de la revue :
Journal of Grid Computing
Pagination :
653-680
Éditeur :
Springer Verlag
Date de publication :
2013-05-24
ISSN :
1570-7873
Discipline(s) HAL :
Informatique [cs]/Intelligence artificielle [cs.AI]
Résumé en anglais : [en]
We address a multicriteria nonpreemptive energy-aware scheduling problem for computationalGrid systems. This work introduces a new formulation of the scheduling problem for multicore heterogeneous computational Grid systems ...
Lire la suite >We address a multicriteria nonpreemptive energy-aware scheduling problem for computationalGrid systems. This work introduces a new formulation of the scheduling problem for multicore heterogeneous computational Grid systems in which the minimization of the energy consumption, along with the makespan metric, is considered. We adopt a two-level model, in which a meta-broker agent (level 1) receives all user tasks and schedules them on the available resources, belonging to different local providers (level 2). The computing capacity and energy consumption of resources are taken from real multi-core processors from the main current vendors. Twenty novel list scheduling methods for the problem are proposed, and a comparative analysis of all of them over a large set of problem instances is presented. Additionally, a scalability study is performed in order to analyze the contribution of the best new bi-objective list scheduling heuristics when the problem dimension grows. We conclude after the experimental analysis that accurate trade-off schedules are computed by using the new proposed methods.Lire moins >
Lire la suite >We address a multicriteria nonpreemptive energy-aware scheduling problem for computationalGrid systems. This work introduces a new formulation of the scheduling problem for multicore heterogeneous computational Grid systems in which the minimization of the energy consumption, along with the makespan metric, is considered. We adopt a two-level model, in which a meta-broker agent (level 1) receives all user tasks and schedules them on the available resources, belonging to different local providers (level 2). The computing capacity and energy consumption of resources are taken from real multi-core processors from the main current vendors. Twenty novel list scheduling methods for the problem are proposed, and a comparative analysis of all of them over a large set of problem instances is presented. Additionally, a scalability study is performed in order to analyze the contribution of the best new bi-objective list scheduling heuristics when the problem dimension grows. We conclude after the experimental analysis that accurate trade-off schedules are computed by using the new proposed methods.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://api.istex.fr/document/781988F695A416DA550288CBD12103F4F8F7640A/fulltext/pdf?sid=hal
- Accès libre
- Accéder au document
- https://api.istex.fr/document/781988F695A416DA550288CBD12103F4F8F7640A/fulltext/pdf?sid=hal
- Accès libre
- Accéder au document
- https://api.istex.fr/document/781988F695A416DA550288CBD12103F4F8F7640A/fulltext/pdf?sid=hal
- Accès libre
- Accéder au document
- https://api.istex.fr/document/781988F695A416DA550288CBD12103F4F8F7640A/fulltext/pdf?sid=hal
- Accès libre
- Accéder au document
- Accès libre
- Accéder au document
- fulltext.pdf
- Accès libre
- Accéder au document