A New Scheduling Algorithm for Parallel Sparse LU Factorization with Static Pivoting
Laura Grigori, Xiaoye Sherry Li · Conference on High Performance Computing (Supercomputing) · 2002
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.