L15: Tree-Structured Algorithms on GPUs CS6963L15: Tree Algorithms.

Download L15: Tree-Structured Algorithms on GPUs CS6963L15: Tree Algorithms.

Post on 16-Dec-2015

212 views

Category:

Documents

0 download

TRANSCRIPT

<ul><li> Slide 1 </li> <li> L15: Tree-Structured Algorithms on GPUs CS6963L15: Tree Algorithms </li> <li> Slide 2 </li> <li> Administrative STRSM due March 17 (EXTENDED) Midterm coming In class April 4, open notes Review notes, readings and review lecture (before break) Will post prior exams Design Review Intermediate assessment of progress on project, oral and short Tentatively April 11 and 13 Final projects Poster session, April 27 (dry run April 25) Final report, May 4 CS6963L15: Tree Algorithms </li> <li> Slide 3 </li> <li> Outline Mapping trees to data-parallel architectures Sources: Parallel scan from Lin and Snyder, _Principles of Parallel Programming_ An Effective GPU Implementation of Breadth-First Search, Lijuan Luo, Martin Wong and Wen-mei Hwu, DAC 10, June 2010. Inter-block GPU communication via fast barrier synchronization, S. Xiao and W. Feng, ?2009 Va. Tech TR?. Stackless KD-Tree Traversal for High Performance GPU Ray Tracing, S. Popov, J. Gunther, H-P Seidel, P. Slusallek, Eurographics 2007, 26(3), 2007. CS6963L15: Tree Algorithms </li> <li> Slide 4 </li> <li> Mapping Challenge From this: CS6963L15: Tree Algorithms To this: </li> <li> Slide 5 </li> <li> Simple Example Parallel Prefix Sum: Compute a partial sum from A[0],,A[n-1] Standard way to express it for (i=0; i</li></ul>

Recommended

View more >