Revisiting Credit Distribution Algorithms for Distributed Termination Detection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Revisiting Credit Distribution Algorithms for Distributed Termination Detection

Abstract

This paper revisits distributed termination detection algorithms in the context of High-Performance Computing (HPC) applications. 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). 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.
Fichier principal
Vignette du fichier
apdcm21.pdf (549.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03920308 , version 1 (03-01-2023)

Identifiers

  • HAL Id : hal-03920308 , version 1

Cite

George Bosilca, Aurélien Bouteiller, Thomas Herault, Valentin Le Fèvre, Yves Robert, et al.. Revisiting Credit Distribution Algorithms for Distributed Termination Detection. APDCM 2021 - 23rd Workshop on Advances in Parallel and Distributed Computational Models, 2021, Portland, OR, United States. ⟨hal-03920308⟩
28 View
35 Download

Share

Gmail Facebook X LinkedIn More