Paper: Impact of communications on the complexity of the Parallel Gaussian Elimination

Authors:
E. Bampis;J. C. Konig;D. Trystram
Affiliations:
-;-;-
Venue:
Parallel Computing
Year:
1991

Citing 4
Cited 1

Optimal scheduling algorithms for parallel Gaussian elimination

Theoretical Computer Science - Special issue on high performance computer systems
Solving Linear Algebraic Equations on an MIMD Computer

Journal of the ACM (JACM)
Operating Systems Theory

Operating Systems Theory
Optimal Parallel Scheduling of Gaussian Elimination DAG's

IEEE Transactions on Computers

An optimal schedule for Gaussian elimination on an MIMD architecture

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an extension to the complexity analysis of parallel algorithms on MIMD computers with a shared-memory system which takes into account communications. This analysis shows that the well-known asymptotically optimal results are insufficient because we show that the overhead is in O(n^3). The optimal parallel time with O(n) processors is only O("n^2). The new scheduling algorithm that we have proposed in this paper reduces the overhead to only O(n^2) with the same parallel time.