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
48
Parallel Prefix Sum (Scan) with CUDA
Mark Harris · 2011 · 542 citations
Prefix sums and their applications
Guy E. Blelloch · Figshare · 2018 · 383 citations · Full text
Clyde P. Kruskal, Larry Rudolph, Marc Snir · IEEE Transactions on Computers · 1985 · 230 citations
1–5 of 48
108
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 108
54
Carnegie Mellon University
Pittsburgh, United States
4 h-index
8 publications
937 citations
University of Virginia
Charlottesville, United States
3 h-index
5 publications
241 citations
University of Maryland, College Park
College Park, United States
3 h-index
5 publications
103 citations
The University of Texas at Austin
Austin, United States
3 h-index
5 publications
159 citations

Hiroshima University
Hiroshima, Japan
2 h-index
5 publications
63 citations
Nvidia (United Kingdom)
Reading, United Kingdom
2 h-index
3 publications
732 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
3 publications
230 citations

Imperial College London
London, United Kingdom
2 h-index
7 publications
169 citations
1–8 of 54
2 publications · 292 citations
2
h-index
2 publications · 31 citations
2
h-index
1 publications · 26 citations
1
h-index
1 publications · 23 citations
1
h-index
1 publications · 174 citations
1
h-index
1–5