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

Authors

100

  1. PL
    Per Larsson-Edefors

    Chalmers University of Technology, Sweden

    4 publications · 125 citations

    4

    h-index

  2. MS
    Magnus Själander

    Chalmers University of Technology, Sweden

    3 publications · 112 citations

    3

    h-index

  3. GA
    Gyula A. Mag�

    University of North Carolina at Chapel Hill, United States

    2 publications · 98 citations

    2

    h-index

  4. HE
    Henrik Eriksson

    Linköping University, Sweden

    2 publications · 54 citations

    2

    h-index

  5. PG
    Per Gunnar Kjeldsberg

    Norwegian University of Science and Technology, Norway

    1 publications · 17 citations

    1

    h-index

1–5 of 100

Venues

  1. International Journal of Parallel Programming

    2 publications · 98 citations

    2

    h-index

  2. XRDS Crossroads The ACM Magazine for Students

    1 publications · 38 citations

    1

    h-index

  3. Parallel Computing

    1 publications · 23 citations

    1

    h-index

  4. Data Mining and Knowledge Discovery

    1 publications · 14 citations

    1

    h-index

  5. Theoretical Computer Science

    1 publications · 21 citations

    1

    h-index

1–5