Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors
- 12 April 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (1) , 21-29
- https://doi.org/10.1016/0020-0190(89)90104-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The ijk forms of factorization methods II. Parallel systemsParallel Computing, 1988
- Parallel Gaussian elimination on an MIMD computerParallel Computing, 1988
- Communication complexity of the Gaussian elimination algorithm on multiprocessorsLinear Algebra and its Applications, 1986
- Complexity of dense-linear-system solution on a multiprocessor ringLinear Algebra and its Applications, 1986
- On the Impact of Communication Complexity on the Design of Parallel Numerical AlgorithmsIEEE Transactions on Computers, 1984
- Solving Linear Algebraic Equations on an MIMD ComputerJournal of the ACM, 1983
- Some Complexity Results for Matrix Computations on Parallel ProcessorsJournal of the ACM, 1978