Optimal scheduling algorithms for parallel Gaussian elimination

DOI10.1016/0304-3975(89)90059-5zbMath0681.65014OpenAlexW3002895390MaRDI QIDQ1823614

Denis Trytram, Yves Robert

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90059-5

zbMATH Keywords

asymptotic efficiencyGaussian eliminationparallel algorithmshared memory machine3-step scheduling algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Minimizing the schedule length for a parallel 3D-grid precedence graph

Cites Work

• Communication complexity of the Gaussian elimination algorithm on multiprocessors
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Solving Linear Algebraic Equations on an MIMD Computer
• On Stable Parallel Linear System Solvers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal scheduling algorithms for parallel Gaussian elimination