All-reduce Operations

All-Reduce Operations is a collective communication primitive in distributed memory programming that belongs to the class of reduction operations and is distinguished by its requirement to compute a global reduction (such as sum, max, or product) of data across all processing elements and then distribute the resulting value to every participant in the system.

14

Publications

572

Citations

62

Authors

22

Institutions

Publications per year

2017–2026

10

Authors

62

  1. JK
    Jakub Konečný

    University of Edinburgh, United Kingdom

    1 publications · 74 citations

    1

    h-index

  2. GT
    Greg Thorson

    Pacific Northwest National Laboratory, United States

    1 publications · 64 citations

    1

    h-index

  3. WW
    Wenfei Wu

    Tsinghua University, China

    1 publications · 37 citations

    1

    h-index

  4. AM
    Abdullah Muzahid

    University of Illinois Urbana-Champaign, United States

    1 publications · 40 citations

    1

    h-index

  5. SS
    Soham Shah

    IBM Research - Austin, United States

    1 publications · 21 citations

    1

    h-index

1–5 of 62

Venues

  1. IEEE Access

    1 publications · 34 citations

    1

    h-index

  2. 1

    h-index

  3. ACM Transactions on Parallel Computing

    TOPC · 1 publications · 14 citations

    1

    h-index

  4. IEEE Computer Architecture Letters

    1 publications · 24 citations

    1

    h-index

  5. Parallel Computing

    1 publications · 12 citations

    1

    h-index

1–5