Adaptive Strassen and ATLAS's DGEMM: a fast square-matrix multiply for modern high-performance systems

Abstract

Strassen's algorithm has practical performance benefits for architectures with simple memory hierarchies, because it trades computationally expensive matrix multiplications (MM) with cheaper matrix additions (MA). However, it presents no advantages for high-performance architectures with deep memory hierarchies, because MAs exploit limited data reuse. We present an easy-to-use adaptive algorithm combining Strassen's recursion and high-tuned version of ATLAS MM. In fact, we introduce a last step in the ATLAS-installation process that determines whether Strassen's may achieve any speedup. We present a recursive algorithm achieving up to 30% speed-up versus ATLAS alone. We show experimental results for 14 different systems

12 Figures and Tables

Cite this paper

@article{DAlberto2005AdaptiveSA, title={Adaptive Strassen and ATLAS's DGEMM: a fast square-matrix multiply for modern high-performance systems}, author={Paolo D'Alberto and Alex Nicolau}, journal={Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)}, year={2005}, pages={8 pp.-52} }