Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles PeerJ Computer Science Year : 2022

Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing

Abstract

High-performance computing (HPC) relies increasingly on heterogeneous hardware and especially on the combination of central and graphical processing units. The task-based method has demonstrated promising potential for parallelizing applications on such computing nodes. With this approach, the scheduling strategy becomes a critical layer that describes where and when the ready-tasks should be executed among the processing units. In this study, we describe a heuristic-based approach that assigns priorities to each task type. We rely on a fitness score for each task/worker combination for generating priorities and use these for configuring the Heteroprio scheduler automatically within the StarPU runtime system. We evaluate our method’s theoretical performance on emulated executions and its real-case performance on multiple different HPC applications. We show that our approach is usually equivalent or faster than expert-defined priorities.
Fichier principal
Vignette du fichier
peerj-cs-969.pdf (3.84 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02993015 , version 1 (06-11-2020)
hal-02993015 , version 2 (28-12-2022)

Identifiers

  • HAL Id : hal-02993015 , version 2

Cite

Clément Flint, Bérenger Bramas, Ludovic Paillat. Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing. PeerJ Computer Science, 2022. ⟨hal-02993015v2⟩
223 View
132 Download

Share

Gmail Facebook Twitter LinkedIn More