Obtaining Dynamic Scheduling Policies with Simulation and Machine Learning - Archive ouverte HAL Access content directly
Conference Papers Year :

Obtaining Dynamic Scheduling Policies with Simulation and Machine Learning

(1, 2) , (2)
1
2

Abstract

Dynamic scheduling of tasks in large-scale HPC platforms is normally accomplished using ad-hoc heuristics, based on task characteristics, combined with some backfilling strategy. Defining heuristics that work efficiently in different scenarios is a difficult task, specially when considering the large variety of task types and platform architectures. In this work, we present a methodology based on simulation and machine learning to obtain dynamic scheduling policies. Using simulations and a workload generation model, we can determine the characteristics of tasks that lead to a reduction in the mean slowdown of tasks in an execution queue. Modeling these characteristics using a nonlinear function and applying this function to select the next task to execute in a queue dramatically improved the mean task slowdown in synthetic workloads. When applied to real workload traces from highly different machines, these functions still resulted in important performance improvements, attesting the generalization capability of the obtained heuristics.
Fichier principal
Vignette du fichier
paper-hal.pdf (3.23 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01618940 , version 1 (18-10-2017)

Identifiers

  • HAL Id : hal-01618940 , version 1

Cite

Danilo Carastan-Santos, Raphael Yokoingawa de Camargo. Obtaining Dynamic Scheduling Policies with Simulation and Machine Learning. SC'17 -2 International Conference for High Performance Computing, Networking, Storage and Analysis (Supercomputing), Nov 2017, Denver, United States. ⟨hal-01618940⟩
653 View
1375 Download

Share

Gmail Facebook Twitter LinkedIn More