Treffer: Revisiting credit distribution algorithms for distributed termination detection
Title:
Revisiting credit distribution algorithms for distributed termination detection
Authors:
Publisher Information:
Institute of Electrical and Electronics Engineers (IEEE) 2021
Document Type:
E-Ressource
Electronic Resource
Index Terms:
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors, Electronic data processing--Distributed processing., Heuristic algorithms, Parallel algorithms, High performance computing, Termination detection, Credit distribution algorithms, Task-based HPC application, Control messages, Supercomputadors, Conference lecture
Availability:
Open access content. Open access content
Open Access
Open Access
Note:
10 p.
application/pdf
English
application/pdf
English
Other Numbers:
HGF oai:upcommons.upc.edu:2117/358317
Bosilca, G. [et al.]. Revisiting credit distribution algorithms for distributed termination detection. A: IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW). "2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW): Portland, OR, USA, 17-21 June 2021: Proceedings". Institute of Electrical and Electronics Engineers (IEEE), 2021, p. 611-620. ISBN 978-1-6654-3577-2. DOI 10.1109/IPDPSW52791.2021.00095.
978-1-6654-3577-2
10.1109/IPDPSW52791.2021.00095
1289793405
Bosilca, G. [et al.]. Revisiting credit distribution algorithms for distributed termination detection. A: IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW). "2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW): Portland, OR, USA, 17-21 June 2021: Proceedings". Institute of Electrical and Electronics Engineers (IEEE), 2021, p. 611-620. ISBN 978-1-6654-3577-2. DOI 10.1109/IPDPSW52791.2021.00095.
978-1-6654-3577-2
10.1109/IPDPSW52791.2021.00095
1289793405
Contributing Source:
UNIV POLITECNICA DE CATALUNYA
From OAIster®, provided by the OCLC Cooperative.
From OAIster®, provided by the OCLC Cooperative.
Accession Number:
edsoai.on1289793405
Database:
OAIster
Weitere Informationen
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.
Peer Reviewed
Postprint (author's final draft)