The problem of small and large matrices in parallel Matrix Multiplication

DOI10.1080/1063719031000087996zbMATH Open1058.65052OpenAlexW1986096481MaRDI QIDQ4472610FDOQ4472610

Authors: Cristiana Piano 

Publication date: 1 July 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1063719031000087996

Recommendations

• scientific article; zbMATH DE number 2086166
• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• Communication and matrix computations on large message passing systems
• Parallel matrix multiplication: a systematic journey
• Study on parallel algorithm for matrix multiplication

zbMATH Keywords

numerical examplescommunicationparallel computationmatrix multiplicationrectangular matriceslarge matricesCannon's algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Efficient Matrix Multiplication on SIMD Computers

Cited In (3)

• Title not available (Why is that?)
• Communication and matrix computations on large message passing systems
• Large matrix, small rank

This page was built for publication: The problem of small and large matrices in parallel Matrix Multiplication

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