The International Conference for High Performance Computing, Networking, Storage, and Analysis
The International Conference for High Performance Computing, Networking, Storage, and Analysis
Workshop: IA^3 2022 - 12th Workshop on Irregular Applications: Architectures and Algorithms
Authors: Pedro Valero-Lara (Oak Ridge National Laboratory (ORNL)), Cameron Greenwalt (Brigham Young University), and Jeffrey Vetter (Oak Ridge National Laboratory (ORNL))
Abstract: Decomposing sparse matrices into lower and upper triangular matrices (sparse LU factorization) is a key operation in many computational scientific applications. We developed SparseLU, a sparse linear algebra library that implements a new algorithm for LU factorization on general sparse matrices. The new algorithm divides the input matrix into tiles to which OpenMP tasks are created for factorization computation, where only tiles that contain nonzero elements are computed. For comparative performance analysis, we used the reference library SuperLU. Testing was performed on synthetically generated matrices which replicate the conditions of the real-world matrices. SparseLU is able to reach a mean speedup of ∼ 29× compared to SuperLU.