Parallel Gather Algorithms

Parallel Gather Algorithms is a computational method in parallel computing that enables the efficient collection and redistribution of non-contiguous data elements from distributed memory locations to a centralized processor or memory unit by concurrently executing gather operations across multiple processing elements.

9

Publications

292

Citations

33

Authors

15

Institutions

Publications per year

2017–2026

1

Authors

33

  1. NN
    Neophytos Neophytou

    University of Warwick, United Kingdom

    2 publications · 50 citations

    2

    h-index

  2. LJ
    Lijuan Jiang

    Chinese Academy of Sciences, China

    1 publications · 34 citations

    1

    h-index

  3. ‪Y
    ‪Keiji Yanai‬

    University of Electro-Communications, Japan

    1 publications · 15 citations

    1

    h-index

  4. RT
    Rajeev Thakur

    Argonne National Laboratory, United States

    1 publications · 13 citations

    1

    h-index

  5. JL
    Jesper Larsson Träff

    TU Wien, Austria

    1 publications · 13 citations

    1

    h-index

1–5 of 33

Venues

  1. 1

    h-index

  2. Volume graphics ...

    1 publications · 16 citations

    1

    h-index

  3. Image and Vision Computing

    1 publications · 15 citations

    1

    h-index

  4. ACM Transactions on Architecture and Code Optimization

    TACO · 1 publications · 34 citations

    1

    h-index

  5. Cluster Computing

    1 publications · 23 citations

    1

    h-index

1–5