A new scheduling algorithm for parallel sparse LU factorization with static pivoting

Authors:
Laura Grigori;Xiaoye S. Li
Affiliations:
Lawrence Berkeley National Laboratory, Berkeley, CA;Lawrence Berkeley National Laboratory, Berkeley, CA
Venue:
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Year:
2002

Citing 11
Cited 6

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
Elimination structures for unsymmetric sparse LU factors

SIAM Journal on Matrix Analysis and Applications
Exploiting structural symmetry in a sparse partial pivoting code

SIAM Journal on Scientific Computing
A mapping algorithm for parallel sparse Cholesky factorization

SIAM Journal on Scientific Computing
Modification of the minimum-degree algorithm by multiple elimination

ACM Transactions on Mathematical Software (TOMS)
A Supernodal Approach to Sparse Partial Pivoting

SIAM Journal on Matrix Analysis and Applications
Analysis and comparison of two general sparse solvers for distributed memory computers

ACM Transactions on Mathematical Software (TOMS)
Making sparse Gaussian elimination scalable by static pivoting

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix

SIAM Journal on Matrix Analysis and Applications
Task Scheduling in Multiprocessing Systems

Computer

Reducing Power with Performance Constraints for Parallel Sparse Applications

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
An overview of SuperLU: Algorithms, implementation, and user interface

ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Reducing energy consumption of parallel sparse matrix applications through integrated link/CPU voltage scaling

The Journal of Supercomputing
GREMLINS: a large sparse linear solver for grid environment

Parallel Computing
Multi-pass mapping schemes for parallel sparse matrix computations

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a static scheduling algorithm for parallel sparse LU factorization with static pivoting. The algorithm is divided into mapping and scheduling phases, using the symmetric pruned graphs of LT and U to represent dependencies. The scheduling algorithm is designed for driving the parallel execution of the factorization on a distributed-memory architecture. Experimental results and comparisons with SuperLU_DIST are reported after applying this algorithm on real world application matrices on an IBM SP RS/6000 distributed memory machine.