Implementation of matrix multiplication on the T-RACK

DOI10.1016/0167-8191(90)90111-LMaRDI QIDQ753425zbMATH OpenOpenAlexFDO

Authors J. J. Modi, Theoharis Theoharis

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90111-l

zbMATH Keywords

algorithmmatrix multiplicationblock partitioning methodcomputation and communication complexityMIMD computers

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Parallel algorithms and architectures for matrix multiplication
• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• Communication-efficient matrix multiplication on hypercubes
• scientific article; zbMATH DE number 823632
• OPTIMIZING THE MATRIX MULTIPLICATION PARALLEL ALGORITHMS ON A DISTRIBUTED-MEMORY MIMD MULTIPROCESSOR

Cited in

(3)

• scientific article; zbMATH DE number 524112 (Why is no real title available?)
• scientific article; zbMATH DE number 823632 (Why is no real title available?)
• OPTIMIZING THE MATRIX MULTIPLICATION PARALLEL ALGORITHMS ON A DISTRIBUTED-MEMORY MIMD MULTIPROCESSOR

This page was built for publication: Implementation of matrix multiplication on the T-RACK

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753425)