Co-scheduling algorithms for high-throughput workload execution

Abstract : This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective is to determine a partition into packs, and an assignment of processors to applications, that minimize the sum of the execution times of the packs. We thoroughly study the complexity of this optimization problem , and propose several heuristics that exhibit very good performance on a variety of workloads, whose application execution times model profiles of parallel scientific codes. We show that co-scheduling leads to faster workload completion time (40% improvement on average over traditional scheduling) and to faster response times (50% improvement). Hence co-scheduling increases system throughput and saves energy, leading to significant benefits from both the user and system perspectives.
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2016, Journal of Scheduling, 19 (6), pp.627-640. 〈〉. 〈10.1007/s10951-015-0445-x〉
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger
Contributeur : Equipe Roma <>
Soumis le : jeudi 7 janvier 2016 - 14:55:58
Dernière modification le : samedi 21 avril 2018 - 01:27:27
Document(s) archivé(s) le : vendredi 8 avril 2016 - 13:26:43


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




Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert, Padma Raghavan. Co-scheduling algorithms for high-throughput workload execution. Journal of Scheduling, Springer Verlag, 2016, Journal of Scheduling, 19 (6), pp.627-640. 〈〉. 〈10.1007/s10951-015-0445-x〉. 〈hal-01252366〉



Consultations de la notice


Téléchargements de fichiers