Comparing Distributed Termination Detection Algorithms for Modern HPC Platforms

George Bosilca, Aurélien Bouteiller, Thomas Herault, Valentin Le Fèvre, Yves Robert, Jack Dongarra


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. We then compare the implementation of these algorithms over a task-based runtime system, PaRSEC and show the advantages and limitations of each approach in a real implementation.


Termination detection; credit distribution algorithms; task-based HPC application; control messages

Full Text:



  • There are currently no refbacks.