Recursive Doubling
Recursive Doubling is a collective communication algorithm in parallel computing that belongs to the class of broadcast or reduction methods, distinguished by its iterative process in which each participating processor doubles the number of nodes it communicates with in each step, effectively spanning the entire processor set in logarithmic time.
19
Publications
802
Citations
40
Authors
25
Institutions
Publications per year
2017–2026
0
Parents
19
Fast tridiagonal solvers on the GPU
Yao Zhang, Jonathan Cohen, John D. Owens · 2010 · 212 citations · Full text
Undirected connectivity in O(log/sup 1.5/n) space
Noam Nisan, Endre Szemerédi, Avi Wigderson · 1992 · 83 citations
Fast tridiagonal solvers on the GPU
Yao Zhang, Jonathan Cohen, John D. Owens · ACM SIGPLAN Notices · 2010 · 77 citations
1–5 of 19
40
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 40
25
Nvidia (United States)
Santa Clara, United States
2 h-index
2 publications
289 citations
University of California, Davis
Davis, United States
2 h-index
4 publications
578 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
284 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
83 citations
Darmstadt University of Applied Sciences
Darmstadt, Germany
1 h-index
1 publications
23 citations
Princeton University
Princeton, United States
1 h-index
1 publications
83 citations

Pennsylvania State University
State College, United States
1 h-index
2 publications
40 citations

Brandeis University
Waltham, United States
1 h-index
2 publications
46 citations
1–8 of 25
2 publications · 28 citations
2
h-index
1 publications · 23 citations
1
h-index
1 publications · 77 citations
1
h-index
1 publications · 21 citations
1
h-index
1 publications · 20 citations
1
h-index
1–5