Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures

C. C. Chou, Y. F. Deng, G. Li, Y. Wang

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

We present a parallel method for matrix multiplication on distributed-memory MIMD architectures based on Strassen's method. Our timing tests, performed on a 56-node Intel Paragon, demonstrate the realization of the potential of the Strassen's method with a complexity of 4.7 M2.807 at the system level rather than the node level at which several earlier works have been focused. The parallel efficiency is nearly perfect when the processor number is the power of 7. The parallelized Strassen's method seems always faster than the traditional matrix multiplication methods whose complexity is 2M3 coupled with the BMR method and the Ring method at the system level. The speed gain depends on matrix order M: 20% for M ≈ 1000 and more than 100% for M ≈ 5000.

Original languageEnglish
Pages (from-to)49-69
Number of pages21
JournalComputers and Mathematics with Applications
Volume30
Issue number2
DOIs
Publication statusPublished - 1995 Jul

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures'. Together they form a unique fingerprint.

  • Cite this