Distributed Termination Detection for HPC Task-Based Environments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2018

Distributed Termination Detection for HPC Task-Based Environments


This paper revisits distributed termination detection algorithms in the context of high-performance computing applications in task systems. We first outline the need to efficiently detect termination in workflows for which the total number of tasks is data dependent and therefore not known statically but only revealed dynamically during execution. We introduce an efficient variant of the Credit Distribution Algorithm (CDA) and compare it to the original algorithm (HCDA) as well as to its two primary competitors: the Four Counters algorithm (4C) and the Efficient Delay-Optimal Distributed algorithm (EDOD). On the theoretical side, we analyze the behavior of each algorithm for some simplified task-based kernels and show the superiority of CDA in terms of the number of control messages. On the practical side, we provide a highly tuned implementation of each termination detection algorithm within PaRSEC and compare their performance for a variety of benchmarks, extracted from scientific applications that exhibit dynamic behaviors.
Fichier principal
Vignette du fichier
rr9181.pdf (947.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01811823 , version 1 (10-06-2018)


  • HAL Id : hal-01811823 , version 1


George Bosilca, Aurelien Bouteiller, Thomas Hérault, Valentin Le Fèvre, Yves Robert, et al.. Distributed Termination Detection for HPC Task-Based Environments. [Research Report] RR-9181, Inria - Research Centre Grenoble – Rhône-Alpes. 2018, pp.1-28. ⟨hal-01811823⟩
138 View
242 Download


Gmail Facebook Twitter LinkedIn More