Modelling and analysis of communication overhead for parallel matrix algorithms
DOI10.1016/S0895-7177(00)00140-0zbMATH Open0955.65017OpenAlexW2036249752MaRDI QIDQ1585824FDOQ1585824
Authors: Xiaodong Wang, Vwani Roychowdhury 
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
Recommendations
- Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods
- scientific article; zbMATH DE number 3999131
- Publication:4721511
- Communication and matrix computations on large message passing systems
- Impact of communications of the complexity of the parallel Gaussian elimination
performanceGaussian eliminationhypercubesLU factorizationcommunication overheadparallel matrix algorithmsGauss-Jordan matrix inversionoverlap of communication and computationperformance modelling and analysis
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Optimum broadcasting and personalized communication in hypercubes
- Title not available (Why is that?)
- Rehabilitation of the Gauss-Jordan algorithm
- Solving Tridiagonal Systems on Ensemble Architectures
- Development of Parallel Methods for a $1024$-Processor Hypercube
- The ijk forms of factorization methods. II: Parallel systems
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor
- A balanced submatrix merging algorithm for multiprocessor architectures
- Parallel matrix inversion on a subcube-grid
Cited In (2)
This page was built for publication: Modelling and analysis of communication overhead for parallel matrix algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585824)
