Parallel Reduction Algorithms
Parallel Reduction Algorithms is a systematic method in parallel algorithm design that performs scalable reduction operations by hierarchically combining distributed data elements into a single result through synchronized, tree-based communication patterns across processing units.
222
Publications
9K
Citations
563
Authors
229
Institutions
Publications per year
2017–2026
28
222
1–5 of 222
563
6
h-index
6
h-index
5
h-index
Max Planck Institute for Dynamics of Complex Technical Systems, Germany
4 publications · 92 citations
4
h-index
3
h-index
1–5 of 563
229
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
19 publications
855 citations
Texas A&M University
College Station, United States
8 h-index
16 publications
516 citations
The Ohio State University
Columbus, United States
7 h-index
17 publications
853 citations
University of Tennessee at Knoxville
Knoxville, United States
6 h-index
14 publications
325 citations

Oak Ridge National Laboratory
Oak Ridge, United States
4 h-index
8 publications
132 citations
Purdue University West Lafayette
West Lafayette, United States
4 h-index
4 publications
251 citations
University of Utah
Salt Lake City, United States
4 h-index
8 publications
385 citations

Cornell University
Ithaca, United States
4 h-index
9 publications
452 citations
1–8 of 229
10 publications · 302 citations
10
h-index
6 publications · 650 citations
6
h-index
4 publications · 309 citations
4
h-index
TPDS · 4 publications · 202 citations
4
h-index
4 publications · 171 citations
4
h-index
1–5