A Framework for Efficient Sparse LU Factorization in a Cluster Based Platform

Authors:
Laura Grigori
Affiliations:
-
Venue:
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
Year:
2001

Citing 6
Cited 0

The role of elimination trees in sparse factorization

SIAM Journal on Matrix Analysis and Applications
Exploiting structural symmetry in unsymmetric sparse symbolic factorization

SIAM Journal on Matrix Analysis and Applications
A mapping algorithm for parallel sparse Cholesky factorization

SIAM Journal on Scientific Computing
In search of clusters (2nd ed.)

In search of clusters (2nd ed.)
A Supernodal Approach to Sparse Partial Pivoting

SIAM Journal on Matrix Analysis and Applications
A parallel algorithm for sparse symbolic LU factorization without pivoting on out—of—core matrices

ICS '01 Proceedings of the 15th international conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address necessary issues in developing an efficient parallel sparse LU factorization without pivoting in a cluster technology. The algorithm we propose reduces the communications between processors by using an adequate mapping algorithm. The volume of communications during parallel symbolic factorization is decreased by using the notion of symmetric pruning of the directed graph of L.