Modelling and analysis of communication overhead for parallel matrix algorithms

DOI10.1016/S0895-7177(00)00140-0zbMath0955.65017OpenAlexW2036249752MaRDI QIDQ1585824

Vwani P. Roychowdhury, Xiaodong Wang

Publication date: 14 November 2000

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(00)00140-0

zbMATH Keywords

performanceGaussian eliminationhypercubesLU factorizationcommunication overheadparallel matrix algorithmsGauss-Jordan matrix inversionoverlap of communication and computationperformance modelling and analysis

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Parallel short range molecular dynamics simulations on computer clusters: performance evaluation and modeling

Cites Work

• Unnamed Item
• The ijk forms of factorization methods. II: Parallel systems
• Rehabilitation of the Gauss-Jordan algorithm
• A balanced submatrix merging algorithm for multiprocessor architectures
• Parallel matrix inversion on a subcube-grid
• Solving Tridiagonal Systems on Ensemble Architectures
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• Development of Parallel Methods for a $1024$-Processor Hypercube
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: Modelling and analysis of communication overhead for parallel matrix algorithms