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
Parents
9
Efficient gather and scatter operations on graphics processors
Bingsheng He, Naga K. Govindaraju, Qiong Luo et al. · 2007 · 128 citations
GPU accelerated image aligned splatting
Neophytos Neophytou, Klaus Mueller · 2005 · 34 citations
1–5 of 9
33
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 33
15

Concordia University
Montreal, Canada
1 h-index
3 publications
33 citations

Peking University
Beijing, China
1 h-index
1 publications
34 citations
NEC (Japan)
Tokyo, Japan
1 h-index
3 publications
39 citations
Argonne National Laboratory
Lemont, United States
1 h-index
2 publications
26 citations

University of Electro-Communications
Tokyo, Japan
1 h-index
3 publications
45 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
1 h-index
2 publications
256 citations
Seoul National University
Seoul, South Korea
1 h-index
3 publications
69 citations
Microsoft (United States)
Redmond, United States
1 h-index
2 publications
256 citations
1–8 of 15
1 publications · 13 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 15 citations
1
h-index
TACO · 1 publications · 34 citations
1
h-index
1 publications · 23 citations
1
h-index
1–5