[ News | IPCA | Mirrors | Add | Search | Mail | Help | WoTUG ]
Abstract: In this paper, we give what we believe to be the first high performance parallel implementation of Strassen's algorithm for matrix multiplication. We show how under restricted conditions, this algorithm can be implemented plug compatible with standard parallel matrix multiplication algorithms. Results obtained on a large Intel Paragon system show a 10-20% reduction in execution time compared to what we believe to be the fastest standard parallel matrix multiplication implementation available at this time.
Authors: Brian Grayson; Ajay Shah and Robert van de Geijn (email@example.com). Department of Computer Sciences, University of Texas, USA.