Scheduling Strategies for the Bicriteria Optimization of the Robustness and Makespan - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Scheduling Strategies for the Bicriteria Optimization of the Robustness and Makespan

Louis-Claude Canon
Emmanuel Jeannot

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.
No file

Dates and versions

inria-00333900 , version 1 (24-10-2008)

Identifiers

Cite

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. pp.1-8, ⟨10.1109/IPDPS.2008.4536366⟩. ⟨inria-00333900⟩
87 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More