Issue No. 11 - Nov. (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.311
Stanimire Tomov , University of Tennessee, Knoxville
Jakub Kurzak , University of Tennessee, Knoxville
Jack Dongarra , University of Tennessee, Knoxville and University of Manchester
In recent years, the use of graphics chips has been recognized as a viable way of accelerating scientific and engineering applications, even more so since the introduction of the Fermi architecture by NVIDIA, with features essential to numerical computing, such as fast double precision arithmetic and memory protected with error correction codes. Being the crucial component of numerical software packages, such as LAPACK and ScaLAPACK, the general dense matrix multiplication routine is one of the more important workloads to be implemented on these devices. This paper presents a methodology for producing matrix multiplication kernels tuned for a specific architecture, through a canonical process of heuristic autotuning, based on generation of multiple code variants and selecting the fastest ones through benchmarking. The key contribution of this work is in the method for generating the search space; specifically, pruning it to a manageable size. Performance numbers match or exceed other available implementations.
Graphics processing unit, Instruction sets, Kernel, Computer architecture, Registers, Hardware, CUDA, Graphics processing unit, matrix multiplication, code generation, automatic tuning, GEMM, BLAS
Stanimire Tomov, Jakub Kurzak, Jack Dongarra, "Autotuning GEMM Kernels for the Fermi GPU", IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 2045-2057, Nov. 2012, doi:10.1109/TPDS.2011.311