Memory-efficient matrix multiplication in the BSP model

DOI10.1007/PL00008264MaRDI QIDQ1125810zbMATH OpenFDO

Authors William F. McColl, Alexander Tiskin

Publication date 13 September 2000

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

bulk-synchronous parallel computationshared-memory style programming

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The bulk-synchronous parallel random access machine
• scientific article; zbMATH DE number 1223727
• Direct bulk-synchronous parallel algorithms
• scientific article; zbMATH DE number 1754593
• scientific article; zbMATH DE number 1490004

Cited in

(7)

• Parallel matrix multiplication: a systematic journey
• scientific article; zbMATH DE number 1754593 (Why is no real title available?)
• Scalable and predictable performance for irregular problems using the WPRAM computational model
• A bridging model for multi-core computing
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
• Communication lower bounds and optimal algorithms for numerical linear algebra
• H-BSP: Hierarchical BSP computation model

This page was built for publication: Memory-efficient matrix multiplication in the BSP model

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