Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01252366
Contributor : Equipe Roma <>
Submitted on : Thursday, January 7, 2016 - 2:55:58 PM
Last modification on : Wednesday, February 26, 2020 - 11:14:31 AM
Long-term archiving on: : Friday, April 8, 2016 - 1:26:43 PM

File

jos2014-revised.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

404

Files downloads

405