Parallel Scan Algorithms

Parallel Scan Algorithms is a class of shared-memory parallel algorithms that belong to the family of prefix computation methods, distinguished by their ability to efficiently compute prefix sums or generalized associative operations over an input sequence in parallel while minimizing synchronization and memory access conflicts.

38

Publications

1.5K

Citations

95

Authors

54

Institutions

Publications per year

2017–2026

5

Authors

95

  1. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    4 publications · 210 citations

    4

    h-index

  2. JJ
    James J. Little

    University of British Columbia, Canada

    2 publications · 102 citations

    2

    h-index

  3. CC
    Chris Cundy

    Stanford University, United States

    2 publications · 27 citations

    2

    h-index

  4. ÉM
    Éric Martin

    Novartis (United States), United States

    2 publications · 27 citations

    2

    h-index

  5. AF
    A. Ferreira

    Centre National de la Recherche Scientifique, France

    2 publications · 36 citations

    2

    h-index

1–5 of 95

Venues

  1. 3

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 37 citations

    2

    h-index

  3. Pattern Recognition Letters

    2 publications · 161 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 27 citations

    2

    h-index

  5. Journal of Functional Programming

    1 publications · 17 citations

    1

    h-index

1–5