Submitted by webmaster on
| Title | Optimization for Performance and Energy for Batched Matrix Computations on GPUs |
| Publication Type | Conference Paper |
| Year of Publication | 2015 |
| Authors | Haidar, A., T. Dong, P. Luszczek, S. Tomov, and J. Dongarra |
| Conference Name | 8th Workshop on General Purpose Processing Using GPUs (GPGPU 8) |
| Date Published | 2015-02 |
| Publisher | ACM |
| Conference Location | San Francisco, CA |
| Keywords | batched factorization, hardware accelerators, numerical linear algebra, numerical software libraries, one-sided factorization algorithms |
| Abstract | As modern hardware keeps evolving, an increasingly effective approach to develop energy efficient and high-performance solvers is to design them to work on many small size independent problems. Many applications already need this functionality, especially for GPUs, which are known to be currently about four to five times more energy efficient than multicore CPUs. We describe the development of the main one-sided factorizations that work for a set of small dense matrices in parallel, and we illustrate our techniques on the LU and Cholesky factorizations. We refer to this mode of operation as a batched factorization. Our approach is based on representing the algorithms as a sequence of batched BLAS routines for GPU-only execution. The goal of avoiding multicore CPU use, e.g., as in the hybrid CPU-GPU algorithms, is to exclusively benefit from the GPU’s significantly higher energy efficiency, as well as from the removal of the costly CPU-to-GPU communications. Furthermore, we do not use a single symmetric multiprocessor (on the GPU) to factorize a single problem at a time. We illustrate how our performance analysis and the use of profiling and tracing tools guided the development and optimization of batched factorizations to achieve up to 2-fold speedup and 3-fold better energy efficiency compared to our highly optimized batched CPU implementations based on the MKL library (when using two sockets of Intel Sandy Bridge CPUs). Compared to a batched LU factorization featured in the CUBLAS library for GPUs, we achieved up to 2.5 speedup on the K40 GPU. |
| DOI | 10.1145/2716282.2716288 |
File:
