Resilient co-scheduling of malleable applications - Archive ouverte HAL Access content directly
Journal Articles International Journal of High Performance Computing Applications Year : 2017

Resilient co-scheduling of malleable applications


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 by frequent failures, and resilience techniques must be employed for large applications to execute efficiently. Indeed, failures may create severe imbalance between applications, and significantly degrade performance. In this paper, we aim at minimizing the expected completion time of a set of co-scheduled applications. We propose to redistribute the resources assigned to each application upon the occurrence of failures, and upon the completion of some applications, in order to achieve this goal. First, we introduce a formal model and establish complexity results. The problem is NP-complete for malleable applications, 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.
Fichier principal
Vignette du fichier
ijhpca-resilient.pdf (860.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01670153 , version 1 (21-12-2017)



Anne Benoit, Loïc Pottier, Yves Robert. Resilient co-scheduling of malleable applications. International Journal of High Performance Computing Applications, 2017, ⟨10.1177/1094342017704979⟩. ⟨hal-01670153⟩
205 View
123 Download



Gmail Facebook X LinkedIn More