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

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 a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Scientific programming Ročník 4; číslo 4; s. 275 - 289
Hlavní autoři: Kumar, B., Huang, C.-H., Sadayappan, P., Johnson, R.W.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Egypt Hindawi Publishing Corporation 17.04.1995
ISSN:1058-9244, 1875-919X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:USDOE Advanced Research Projects Agency - Energy (ARPA-E)
ISSN:1058-9244
1875-919X
DOI:10.1155/1995/636457