Scheduling Strategies for the Bicriteria Optimization of the Robustness and Makespan

Louis-Claude Canon 1 Emmanuel Jeannot 1
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study the problem of scheduling a stochastic task graph with the objective of minimizing the makespan and maximizing the robustness. As these two metrics are not equivalent, we need a bicriteria approach to solve this problem. Moreover, as computing these two criteria is very time consuming we propose different approaches: from an evolutionary meta-heuristic (best solutions but longer computation time) to more simple heuristics making approximations (bad quality solutions but fast computation time). We compare these different strategies experimentally and show that we are able to find different approximations of the Pareto front of this bicriteria problem.
Type de document :
Communication dans un congrès
11th International Workshop on Nature Inspired Distributed Computing (NIDISC'08), in conjunction with IPDPS 2008, Apr 2008, Miami, United States. IEEE, pp.1-8, 2008, IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008. 〈10.1109/IPDPS.2008.4536366〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00333900
Contributeur : Emmanuel Jeannot <>
Soumis le : vendredi 24 octobre 2008 - 13:35:41
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

Collections

Citation

Louis-Claude Canon, Emmanuel Jeannot. Scheduling Strategies for the Bicriteria Optimization of the Robustness and Makespan. 11th International Workshop on Nature Inspired Distributed Computing (NIDISC'08), in conjunction with IPDPS 2008, Apr 2008, Miami, United States. IEEE, pp.1-8, 2008, IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008. 〈10.1109/IPDPS.2008.4536366〉. 〈inria-00333900〉

Partager

Métriques

Consultations de la notice

223