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

Authors

563

  1. LR
    Lawrence Rauchwerger

    Texas A&M University, United States

    6 publications · 222 citations

    6

    h-index

  2. HY
    Hao Yu

    Nanyang Technological University, Singapore

    6 publications · 222 citations

    6

    h-index

  3. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    5 publications · 105 citations

    5

    h-index

  4. PB
    Peter Benner

    Max Planck Institute for Dynamics of Complex Technical Systems, Germany

    4 publications · 92 citations

    4

    h-index

  5. KP
    Keshav Pingali

    The University of Texas at Austin, United States

    3 publications · 384 citations

    3

    h-index

1–5 of 563

Venues

  1. Parallel Computing

    10 publications · 302 citations

    10

    h-index

  2. IEEE Transactions on Computers

    6 publications · 650 citations

    6

    h-index

  3. Information Sciences

    4 publications · 309 citations

    4

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 202 citations

    4

    h-index

  5. Knowledge-Based Systems

    4 publications · 171 citations

    4

    h-index

1–5