1092

Algorithmic performance studies on graphics processing units

O. Schenk, M. Christen, H. Burkhart
Department of Computer Science, University of Basel, Klingelbergstrasse 50, CH-4056 Basel, Switzerland
Journal of Parallel and Distributed Computing, Vol. 68, No. 10. (October 2008), pp. 1360-1369.

@article{schenk2008algorithmic,

   title={Algorithmic performance studies on graphics processing units},

   author={Schenk, O. and Christen, M. and Burkhart, H.},

   journal={Journal of Parallel and Distributed Computing},

   volume={68},

   number={10},

   pages={1360–1369},

   issn={0743-7315},

   year={2008},

   publisher={Elsevier}

}

Download Download (PDF)   View View   Source Source   

673

views

We report on our experience with integrating and using graphics processing units (GPUs) as fast parallel floating-point co-processors to accelerate two fundamental computational scientific kernels on the GPU: sparse direct factorization and nonlinear interior-point optimization. Since a full re-implementation of these complex kernels is typically not feasible, we identify the matrix-matrix multiplication as a first natural entry-point for a minimally invasive integration of GPUs. We investigate the performance on the NVIDIA GeForce 8800 multicore chip initially architectured for intensive gaming applications. We exploit the architectural features of the GeForce 8800 GPU to design an efficient GPU-parallel sparse matrix solver. A prototype approach to leverage the bandwidth and computing power of GPUs for these matrix kernel operation is demonstrated resulting in an overall performance of over 110 GFlops/s on the desktop for large matrices and over 38 GFlops/s for sparse matrices arising in real applications. We use our GPU algorithm for PDE-constrained optimization problems and demonstrate that the commodity GPU is a useful co-processor for scientific applications.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: