Download:
|
by Apostolos Gerasoulis, Tao Yang
http://www.cs.rutgers.edu/~armhold/hpcd/Area_III.3/all_html_files/../all_ps_files/J_Numerical.ps
Add To MetaCart
Abstract:
Column-block partitioning is commonly used in the parallelization of Gaussian-Elimination(GE) and Gauss-Jordan(GJ) algorithms. It is therefore of interest to know performance bounds of such partitioning on scalable distributed-memory parallel architectures. In this paper, we use a graph-theoretic approach in deriving asymptotic performance lower bounds of column-block partitioning for both GE and GJ. The
Citations
|
135
|
Towards an architecture-independent analysis of parallel algorithms
– Papadimitriou, Yannakakis
- 1990
|
|
96
|
Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors
– Sarkar
- 1989
|
|
90
|
On the Granularity and Clustering of Directed Acyclic Task Graphs
– Gerasoulis, Yang
- 1993
|
|
83
|
PYRROS: Static Task Scheduling and Code Generation for Message-Passing Multiprocessors
– Yang, Gerasoulis
- 1992
|
|
25
|
Task scheduling over distributed memory machines
– Chretienne
- 1989
|
|
18
|
Solving Linear Algebraic Equations on an MIMD
– Lord, Kowalik, et al.
- 1983
|
|
9
|
Data allocation strategies for the gauss and jordan algorithms on a ring of processors
– Robert, Tourancheau, et al.
- 1989
|
|
7
|
Gaussian elimination on message passing architecture
– Cosnard, Tourancheau, et al.
- 1987
|
|
4
|
Gaussian Elimination on Hypercubes, Parallel Algorithms and Architectures
– Saad
- 1986
|
|
3
|
Gaussian elimination on hypercube automaton
– Cappello
- 1987
|
|
3
|
Column LU Factorization with Pivoting on a Hypercube Multiprocessor
– Davis
- 1986
|
|
3
|
Complexity of dense linear system solution on a multiprocessor ring
– Ipsen, Saad, et al.
- 1986
|
|
1
|
Scientific Computing : An Introduction to Parallel Computing
– Golub, Ortega
- 1993
|