Bi-objective Scheduling Algorithms for Optimizing Makespan and Reliability on Heterogeneous Systems
Résumé
We tackle the problem of scheduling task graphs onto a heterogeneous set of machines, where each processor has a probability of failure governed by an exponential law. The goal is to design algorithms that optimize both makespan and reliability. First, we provide an optimal scheduling algorithm for independent unitary tasks where the objective is to maximize the reliability subject to makespan minimization. For the bi-criteria case we provide an algorithm that approximates the Pareto-curve. Next, for independent non-unitary tasks we show that the product {\em\{failure rate\}}$\times$ {\em\{unitary instruction execution time\}} is crucial to distinguish processors in this context. Based on this results we are able to let the user choose a trade-off between reliability maximization and makespan minimization. For general task graph we provide a method for converting scheduling heuristics on heterogeneous cluster into heuristics that take reliability into account. Here again, we show how we can help the user to choose a trade-off between makespan and reliability.
Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|