Revisiting Credit Distribution Algorithms for Distributed Termination Detection

Submitted by rander39 on

TitleRevisiting Credit Distribution Algorithms for Distributed Termination Detection
Publication TypeConference Proceedings
Year of Publication2021
AuthorsBosilca, G., A. Bouteiller, T. Herault, V. Le Fèvre, Y. Robert, and J. Dongarra
Conference Name2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
Pagination611–620
PublisherIEEE
Keywordscontrol messages, credit distribution algorithms, task-based HPC application, 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.
DOI10.1109/IPDPSW52791.2021.00095
External Publication Flag: