All-reduce Algorithms
All-Reduce Algorithms is a collective communication paradigm in cluster interconnects and cluster networking that belongs to the class of distributed synchronization methods, distinguished by its ability to perform a global reduction operation across all processing nodes and subsequently broadcast the result to every node in the system.
39
Publications
3.1K
Citations
142
Authors
51
Institutions
Publications per year
2017–2026
20
39
1–5 of 39
142
4
h-index
3
h-index
2
h-index
2 publications · 130 citations
2
h-index
2
h-index
1–5 of 142
51
Argonne National Laboratory
Lemont, United States
3 h-index
5 publications
1.9K citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
4 publications
90 citations

King Abdullah University of Science and Technology
Jeddah, Saudi Arabia
2 h-index
2 publications
111 citations

Peking University
Beijing, China
2 h-index
6 publications
342 citations
The Ohio State University
Columbus, United States
2 h-index
5 publications
164 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
5 publications
275 citations
The University of Texas at Austin
Austin, United States
2 h-index
3 publications
146 citations
Florida State University
Tallahassee, United States
2 h-index
4 publications
870 citations
1–8 of 51
Repository · 4 publications · 496 citations
4
h-index
1 publications · 24 citations
1
h-index
1 publications · 87 citations
1
h-index
1 publications · 397 citations
1
h-index
1 publications · 74 citations
1
h-index
1–5