Reduction Trees
Reduction Trees is a computational framework in parallel processing that organizes reduction operations into a hierarchical tree structure to optimize data aggregation by minimizing communication overhead and enabling efficient synchronization across distributed processing units.
42
Publications
1.9K
Citations
100
Authors
40
Institutions
Publications per year
2017–2026
7
42
Executing functional programs on a virtual tree of processors
F. Warren Burton, M. R. Sleep · 1981 · 197 citations · Full text
1–5 of 42
100
4
h-index
3
h-index
University of North Carolina at Chapel Hill, United States
2 publications · 98 citations
2
h-index
2
h-index
Norwegian University of Science and Technology, Norway
1 publications · 17 citations
1
h-index
1–5 of 100
40
Chalmers University of Technology
Gothenburg, Sweden
3 h-index
11 publications
395 citations
University of Utah
Salt Lake City, United States
2 h-index
3 publications
172 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
2 publications
98 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
10 publications
582 citations

University of East Anglia
Norwich, United Kingdom
2 h-index
3 publications
429 citations
Seoul National University
Seoul, South Korea
1 h-index
4 publications
60 citations
University of Tennessee at Knoxville
Knoxville, United States
1 h-index
4 publications
68 citations
Ludwig-Maximilians-Universität München
Munich, Germany
1 h-index
1 publications
15 citations
1–8 of 40
2 publications · 98 citations
2
h-index
1 publications · 38 citations
1
h-index
1 publications · 23 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 21 citations
1
h-index
1–5