|Title||Scan Primitives for GPU Computing
(In Proceedings) |
|in||Graphics Hardware 2007|
Shubhabrata Sengupta, Mark Harris, Yao Zhang, John D. Owens |
|Location||San Diego, CA|
The scan primitives are powerful, general-purpose data-parallel primitives that are building blocks for a broad
range of applications. We describe GPU implementations of these primitives, specifically an efficient formulation and implementation of segmented scan, on NVIDIA GPUs using the CUDA API. Using the scan primitives, we show novel GPU implementations of quicksort and sparse matrix-vector multiply, and analyze the performance
of the scan primitives, several sort algorithms that use the scan primitives, and a graphical shallow-water fluid simulation using the scan framework for a tridiagonal matrix solver.
The PDF here fixes an error in the descriptions of lines 3 and 6 in Figure 2 (quicksort example). Talk slides can be found at the Graphics Hardware program page. This paper version has low-res figures; a high-res version can be found at the ACM Digital Library. This paper won the Best Paper award at Graphics Hardware 2007.