Parallel Prefix Sum

Parallel Prefix Sum is a computational algorithm that belongs to the class of parallel scan operations, distinguished by its ability to efficiently compute cumulative results over a sequence of data elements in shared-memory parallel systems by leveraging data parallelism through synchronized prefix computations.

48

Publications

3.1K

Citations

108

Authors

54

Institutions

Publications per year

2017–2026

4

Authors

108

  1. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    3 publications · 491 citations

    3

    h-index

  2. DM
    Duane Merrill

    University of Virginia, United States

    3 publications · 168 citations

    3

    h-index

  3. AG
    Andrew Grimshaw

    University of Virginia, United States

    3 publications · 168 citations

    3

    h-index

  4. CW
    Cedric Walravens

    KU Leuven, Belgium

    2 publications · 27 citations

    2

    h-index

  5. JK
    Jeroen Ketema

    Imperial College London, United Kingdom

    2 publications · 48 citations

    2

    h-index

1–5 of 108

Venues

  1. IEEE Transactions on Computers

    2 publications · 292 citations

    2

    h-index

  2. Parallel Processing Letters

    2 publications · 31 citations

    2

    h-index

  3. Journal of Functional Programming

    1 publications · 26 citations

    1

    h-index

  4. International Journal of Parallel Programming

    1 publications · 23 citations

    1

    h-index

  5. SIAM Journal on Computing

    1 publications · 174 citations

    1

    h-index

1–5