Parallel complexity of matrix multiplication

DOI10.1023/A:1023996628662MaRDI QIDQ1404305zbMATH OpenOpenAlexFDO

Authors Eunice E. Santos

Publication date 21 August 2003

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1023996628662

zbMATH Keywords

algorithmsscientific computinglower boundsparallel computationmatrix multiplicationparallel modelsparallel complexitydistributed-memory computersLogP model

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• Scalable parallel matrix multiplication on distributed memory parallel computers
• Communication lower bounds for distributed-memory matrix multiplication
• Parallel matrix multiplication: a systematic journey
• scientific article; zbMATH DE number 4072257

Cited in

(22)

• Your favorite parallel algorithms might not be as fast as you think
• scientific article; zbMATH DE number 4072257 (Why is no real title available?)
• Automatic parallelization of cycles with two-dimensional arrays for distributed memory supercomputers (on the example of matrix multiplication)
• Scalable parallel matrix multiplication on distributed memory parallel computers
• Matrix-vector multiplication: Parallel algorithms and architectures
• Parallel algorithms and architectures for matrix multiplication
• Parallel matrix multiplication: a systematic journey
• scientific article; zbMATH DE number 1275860 (Why is no real title available?)
• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
• scientific article; zbMATH DE number 4003520 (Why is no real title available?)
• To the role of decomposition strategy in high parallel algorithms
• Communication-efficient matrix multiplication on hypercubes
• Experimental evaluation of automatic array alignment in parallelized matlab
• scientific article; zbMATH DE number 741169 (Why is no real title available?)
• Studying and implementing parallel matrix multiplication algorithms
• Communication lower bounds for distributed-memory matrix multiplication
• How to express a parallel sum of k matrices
• Communication complexity of PRAMs
• Locality estimation of parallel algorithm for distributed memory computers
• Work-Preserving Speed-Up of Parallel Matrix Computations
• scientific article; zbMATH DE number 1223727 (Why is no real title available?)
• Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures

This page was built for publication: Parallel complexity of matrix multiplication

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