A Tensor Product Formulation of Strassen's Matrix Multiplication Algorithm with Memory Reduction

Article type: Research Article

Authors: KUMAR, B. | HUANG, C.-H. | SADAYAPPAN, P. | JOHNSON, R.W.

Affiliations: Department of Computer and Information Science, The Ohio State University, Columbus, OH 43210-1277; e-mail: {kumar-b,chh,saday}@cis.ohio-state.edu | Department of Computer Science, St. Cloud State University, St. Cloud, MN 56301; e-mail: [email protected]

Abstract: In this article, we present a program generation strategy of Strassen's matrix multiplication algorithm using a programming methodology based on tensor product formulas. In this methodology, block recursive programs such as the fast Fourier Transforms and Strassen's matrix multiplication algorithm are expressed as algebraic formulas involving tensor products and other matrix operations. Such formulas can be systematically translated to high-performance parallel/vector codes for various architectures. In this article, we present a nonrecursive implementation of Strassen's algorithm for shared memory vector processors such as the Cray Y-MP. A previous implementation of Strassen's algorithm synthesized from tensor product formulas required working storage of size O(7^n) for multiplying 2^n × 2^n matrices. We present a modified formulation in which the working storage requirement is reduced to O(4^n). The modified formulation exhibits sufficient parallelism for efficient implementation on a shared memory multiprocessor. Performance results on a Cray Y-MP8/64 are presented.

Journal: Scientific Programming, vol. 4, no. 4, pp. 275-289, 1995