Abstract
We investigate the performance benefits of a novel recursive formulation of Strassen's algorithm over highly tuned matrix-multiply (MM) routines, such as the widely used ATLAS for high-performance systems. We combine Strassen's recursion with high-tuned version of ATLAS MM and we present a family of recursive algorithms achieving up to 15% speed-up over ATLAS alone. We show experimental results for 7 different systems. © Springer-Verlag Berlin Heidelberg 2008.
Author supplied keywords
Cite
CITATION STYLE
D’Alberto, P., & Nicolau, A. (2008). Using recursion to boost ATLAS’s performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4759 LNCS, pp. 142–151). Springer Verlag. https://doi.org/10.1007/978-3-540-77704-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
