Sparse LU factorization with partial pivoting overlapping communications and computations on the SP-2 multicomputer

Abstract

The problem of solving a sparse linear system of equation (A x x = b) is very important in scientific applications and is still an open problem to develop on multicomputer with distributed memory. This paper presents an algorithm for parallelizing the sparse LU on a SP-2 multicomputer using MPI and standard sparse matrices. Our goal is to implement the parallel algorithm studying the dependence graph of the sequential algorithm which drives us to overlap computations and communications. So, this analysis can be performed by an automatic tool that helps us to choose the best data distribution. The paper analyses the effect of several block sizes in the performance results in order to overlap efficiently.