Communication and matrix computations on large message passing systems

DOI10.1016/0167-8191(90)90156-4zbMATH Open0713.65106OpenAlexW1999928392MaRDI QIDQ750124FDOQ750124

Authors: G. W. Stewart 

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1903/541

Recommendations

• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• The problem of small and large matrices in parallel Matrix Multiplication
• A communications system for irregular local interaction problems on a concurrent computer
• Sparse Matrix Computations on Parallel Processor Arrays
• Data-flow algorithms for parallel matrix computation

zbMATH Keywords

efficiencyhypercubetiming analysisparallel algorithmsmatrix computationsparallel computersmessage passing systemscommunication timescomputation costsconcurrent calculations

Mathematics Subject Classification ID

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

Cited In (6)

• Reduction of the Effects of the Communication Delays in Scientific Algorithms on Message Passing MIMD Architectures
• Modelling and analysis of communication overhead for parallel matrix algorithms
• A communications system for irregular local interaction problems on a concurrent computer
• Parallel matrix multiplication: a systematic journey
• The problem of small and large matrices in parallel Matrix Multiplication
• Communication efficient matrix multiplication on hypercubes

This page was built for publication: Communication and matrix computations on large message passing systems

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