CUDA Papers

A collection of research papers and projects utilizing CUDA technology

Category Archives: Linear Algebra

Efficient Sparse Matrix-Vector Multiplication on CUDA

http://mgarland.org/files/papers/nvr-2008-004.pdf Abstract The massive parallelism of graphics processing units (GPUs) offers tremendous performance in many high-performance computing applications. While dense linear algebra readily maps to such platforms, harnessing this potential for sparse matrix computations presents additional challenges. Given its role in iterative methods for solving sparse linear systems and eigenvalue problems, sparse matrix-vector multiplication (SpMV) […]

Efficient Parallel Scan Algorithms for GPUs

http://mgarland.org/files/papers/nvr-2008-003.pdf Abstract Scan and segmented scan algorithms are crucial building blocks for a great many data-parallel algorithms. Segmented scan and related primitives also provide the necessary support for the flatten- ing transform, which allows for nested data-parallel programs to be compiled into flat data-parallel languages. In this paper, we describe the design of efficient scan […]

Benchmarking GPUs to Tune Dense Linear Algebra

http://portal.acm.org/ft_gateway.cfm?id=1413402&type=pdf&doid2=1413370.1413402 http://www2.computer.org/portal/c/document_library/get_file?folderId=97697&name=DLFE-3337.pdf Abstract We present performance results for dense linear algebra using the 8-series NVIDIA GPUs. Our GEMM routine runs 60% faster than the vendor implementation and approaches the peak of hardware capabilities. Our LU, QR and Cholesky factorizations achieve up to 80-90% of the peak GEMM rate. Our parallel LU running on two GPUs […]