Benchmarking GPUs to tune dense linear algebra
Computer Science Division, University of California at Berkeley
In SC ’08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008), pp. 1-11.
@conference{volkov2008benchmarking,
title={Benchmarking GPUs to tune dense linear algebra},
author={Volkov, V. and Demmel, J.W.},
booktitle={Proceedings of the 2008 ACM/IEEE conference on Supercomputing},
pages={1–11},
year={2008},
organization={IEEE Press}
}
We present performance results for dense linear algebra using recent NVIDIA GPUs. Our matrix-matrix multiply routine (GEMM) runs up to 60% faster than the vendor’s 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 achieves up to ~540 Gflop/s. These results are accomplished by challenging the accepted view of the GPU architecture and programming guidelines. We argue that modern GPUs should be viewed as multithreaded multicore vector units. We exploit blocking similarly to vector computers and heterogeneity of the system by computing both on GPU and CPU. This study includes detailed benchmarking of the GPU memory system that reveals sizes and latencies of caches and TLB. We present a couple of algorithmic optimizations aimed at increasing parallelism and regularity in the problem that provide us with slightly higher performance.
November 4, 2010 by hgpu
