SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Skip to main content
eScholarship
Open Access Publications from the University of California

SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

  • Author(s): Li, Xiaoye S.
  • Demmel, James W.
  • et al.
Abstract

In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with focus on scalability issues, and demonstrate the parallel performance and scalability on current machines. The solver is based on sparse Gaussian elimination, with an innovative static pivoting strategy proposed earlier by the authors. The main advantage of static pivoting over classical partial pivoting is that it permits a priori determination of data structures and communication pattern for sparse Gaussian elimination, which makes it more scalable on distributed memory machines. Based on this a priori knowledge, we designed highly parallel and scalable algorithms for both LU decomposition and triangular solve and we show that they are suitable for large-scale distributed memory machines.

Main Content
Current View