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
Parents
38
Efficient Parallel Scan Algorithms for GPUs
Shubhabrata Sengupta, Mark Harris, Michael Garland · 2011 · 129 citations
1–5 of 38
95
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 95
54
Carnegie Mellon University
Pittsburgh, United States
4 h-index
8 publications
426 citations

Linköping University
Linköping, Sweden
3 h-index
5 publications
309 citations

University of British Columbia
Vancouver, Canada
2 h-index
2 publications
102 citations

École Normale Supérieure de Lyon
Lyon, France
2 h-index
2 publications
36 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
4 publications
72 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
91 citations
Institute of Computing Technology
Beijing, China
2 h-index
6 publications
103 citations

Chinese Academy of Sciences
Beijing, China
2 h-index
6 publications
103 citations
1–8 of 54
TPAMI · 3 publications · 108 citations
3
h-index
TPDS · 2 publications · 37 citations
2
h-index
2 publications · 161 citations
2
h-index
Repository · 2 publications · 27 citations
2
h-index
1 publications · 17 citations
1
h-index
1–5