Using Recursion to Boost ATLAS’s Performance

  • Paolo D’Alberto
  • Alexandru Nicolau
Conference paper

DOI: 10.1007/978-3-540-77704-5_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4759)
Cite this paper as:
D’Alberto P., Nicolau A. (2008) Using Recursion to Boost ATLAS’s Performance. In: Labarta J., Joe K., Sato T. (eds) High-Performance Computing. Lecture Notes in Computer Science, vol 4759. Springer, Berlin, Heidelberg


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.


dense kernels matrix-matrix product performance optimizations 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Paolo D’Alberto
    • 1
  • Alexandru Nicolau
    • 2
  1. 1.Department of Electrical and Computer EngineeringCarnegie Mellon University 
  2. 2.Department of Computer ScienceUniversity of California at Irvine 

Personalised recommendations