Resilient application co-scheduling with processor redistribution

Abstract : Recently, the benefits of co-scheduling several applications have been demonstrated in a fault-free context, both in terms of performance and energy savings. However, large-scale computer systems are confronted to frequent failures, and resilience techniques must be employed to ensure the completion of large applications. Indeed, failures may create severe imbalance between applications, and significantly degrade performance. In this paper, we propose to redistribute the resources assigned to each application upon the striking of failures, in order to minimize the expected completion time of a set of co-scheduled applications. First we introduce a formal model and establish complexity results. When no redistribution is allowed, we can minimize the expected completion time in polynomial time, while the problem becomes NP-complete with redistributions, even in a fault-free context. Therefore, we design polynomial-time heuristics that perform redistributions and account for processor failures. A fault simulator is used to perform extensive simulations that demonstrate the usefulness of redistribution and the performance of the proposed heuristics.
Type de document :
[Research Report] RR-8795, Inria. 2015
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger
Contributeur : Equipe Roma <>
Soumis le : jeudi 22 octobre 2015 - 12:45:50
Dernière modification le : jeudi 27 septembre 2018 - 01:18:58
Document(s) archivé(s) le : vendredi 28 avril 2017 - 07:19:47


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01219258, version 1



Anne Benoit, Loïc Pottier, Yves Robert. Resilient application co-scheduling with processor redistribution. [Research Report] RR-8795, Inria. 2015. 〈hal-01219258〉



Consultations de la notice


Téléchargements de fichiers