A Memory Model for Scientific Algorithms on Graphics Processors
UNC Chapel Hill
Supercomputing, 2006. SC ’06. Proceedings of the ACM/IEEE SC 2006 Conference In Supercomputing, 2006. SC ’06. Proceedings of the ACM/IEEE SC 2006 Conference (2006), pp. 6-6.
@article{govindaraju2006memory,
title={A memory model for scientific algorithms on graphics processors},
author={Govindaraju, N.K. and Larsen, S. and Gray, J. and Manocha, D.},
year={2006},
publisher={IEEE Computer Society}
}
We present a memory model to analyze and improve the performance of scientific algorithms on graphics processing units (GPUs). Our memory model is based on texturing hardware, which uses a 2D block-based array representation to perform the underlying computations. We incorporate many characteristics of GPU architectures including smaller cache sizes, 2D block representations, and use the 3C’s model to analyze the cache misses. Moreover, we present techniques to improve the performance of nested loops on GPUs. In order to demonstrate the effectiveness of our model, we highlight its performance on three memory-intensive scientific applications – sorting, fast Fourier transform and dense matrix-multiplication. In practice, our cache-efficient algorithms for these applications are able to achieve memory throughput of 30-50 GB/s on a NVIDIA 7900 GTX GPU. We also compare our results with prior GPU-based and CPU-based implementations on high-end processors. In practice, we are able to achieve 2-5x performance improvement
October 30, 2010 by hgpu
