Reliable Generation of High-Performance Matrix Algebra
Abstract
Scientific programmers often turn to vendor-tuned Basic Linear Algebra Subprograms (BLAS) to obtain portable high performance. However, many numerical algorithms require several BLAS calls in sequence, and those successive calls result in suboptimal performance. The entire sequence needs to be optimized in concert. Instead of vendor-tuned BLAS, a programmer could start with source code in Fortran or C (e.g., based on the Netlib BLAS) and use a state-of-the-art optimizing compiler. However, our experiments show that optimizing compilers often attain only one-quarter the performance of hand-optimized code. In this paper we present a domain-specific compiler for matrix algebra, the Build to Order BLAS (BTO), that reliably achieves high performance using a scalable search algorithm for choosing the best combination of loop fusion, array contraction, and multithreading for data parallelism. The BTO compiler generates code that is between 16% slower and 39% faster than hand-optimized code.
Cite
@article{arxiv.1205.1098,
title = {Reliable Generation of High-Performance Matrix Algebra},
author = {Geoffrey Belter and Elizabeth Jessup and Thomas Nelson and Boyana Norris and Jeremy G. Siek},
journal= {arXiv preprint arXiv:1205.1098},
year = {2012}
}