Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors

DOI10.1016/0020-0190(89)90104-XzbMath0681.65015OpenAlexW2070588089MaRDI QIDQ1823615

Bernard Tourancheau, Gilles Villard, Yves Robert

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90104-x

zbMATH Keywords

hypercubenumerical experimentsGauss eliminationparallel implementationparallel architectureallocation functionring of processorsJordan eliminationtotal time complexity

Mathematics Subject Classification ID

Related Items (1)

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

Cites Work

• Complexity of dense-linear-system solution on a multiprocessor ring
• Communication complexity of the Gaussian elimination algorithm on multiprocessors
• Parallel Gaussian elimination on an MIMD computer
• The ijk forms of factorization methods. II: Parallel systems
• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
• Solving Linear Algebraic Equations on an MIMD Computer
• Some Complexity Results for Matrix Computations on Parallel Processors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors