A scalable parallel Strassen`s matrix multiply algorithm for distributed memory computers
Conference
·
OSTI ID:52844
- Univ. of the South, Sewanee, TN (United States)
- Oak Ridge National Lab., TN (United States)
The authors present a scalable parallel Strassen`s matrix multiply algorithm for distributed memory, message passing computers. Strassen`s algorithm to multiply two N x N matrices reduces the asymptotic operation count from O(N{sup 3}) of the traditional algorithm to O(N{sup 2.81}). In a sequential implementation the Strassen`s algorithm offers better performance even for relatively low order matrices. However, due to its complexity, the parallel Strassen`s algorithm is less than straight forward. Here a scalable parallel Strassen`s algorithm is presented and compared with several other parallel algorithms. Performances of these algorithms are tested on a 128-processor Intel iPSC/860.
- Research Organization:
- Oak Ridge National Lab., TN (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 52844
- Report Number(s):
- CONF-950242--2; ON: DE95010213
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Tensor Product Formulation of Strassen′s Matrix Multiplication Algorithm with Memory Reduction
Performance of a plasma fluid code on the Intel parallel computers
Parallel community climate model: Description and user`s guide
Journal Article
·
Mon Apr 17 00:00:00 EDT 1995
· Scientific Programming
·
OSTI ID:1198030
Performance of a plasma fluid code on the Intel parallel computers
Conference
·
Sat Oct 31 23:00:00 EST 1992
·
OSTI ID:10138745
Parallel community climate model: Description and user`s guide
Technical Report
·
Mon Jul 15 00:00:00 EDT 1996
·
OSTI ID:279706