Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods

DOI10.1016/0168-9274(94)00051-4zbMath0814.65028OpenAlexW2032217381MaRDI QIDQ1344340

Apostolos Gerasoulis, Tao Yang

Publication date: 18 June 1995

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(94)00051-4

zbMATH Keywords

performancenumerical experimentsGaussian eliminationtask schedulingblock partitioningGauss-Jordan algorithmasymptotic lower boundsdistributed-memory parallel architecturesparallel numerical computing

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of dense-linear-system solution on a multiprocessor ring
• On Graham's bound for cyclic scheduling
• Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Column LU Factorization with Pivoting on a Message-Passing Multiprocessor
• Solving Linear Algebraic Equations on an MIMD Computer

This page was built for publication: Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods