Batched sparse direct solver design and evaluation in SuperLU_DIST.

Saved in:
Bibliographic Details
Title: Batched sparse direct solver design and evaluation in SuperLU_DIST.
Authors: Boukaram, Wajih, Hong, Yuxi, Liu, Yang, Shi, Tianyi, Li, Xiaoye S
Source: International Journal of High Performance Computing Applications; Nov2024, Vol. 38 Issue 6, p585-598, 14p
Subject Terms: FUNCTION algebras, DIRECTED acyclic graphs, LINEAR algebra, FACTORIZATION, BANDWIDTHS
Abstract: Over the course of interactions with various application teams, the need for batched sparse linear algebra functions has emerged in order to make more efficient use of the GPUs for many small and sparse linear algebra problems. In this paper, we present our recent work on a batched sparse direct solver for GPUs. The sparse LU factorization is computed by the levels of the elimination tree, leveraging the batched dense operations at each level and a new batched Scatter GPU kernel. The sparse triangular solve is computed by the level sets of the directed acyclic graph (DAG) of the triangular matrix. Batched operations overcome the large overhead associated with launching many small kernels. For medium sized matrix batches with not-so-small bandwidth, using an NVIDIA A100 GPU, our new batched sparse direct solver is orders of magnitude faster than a batched banded solver and uses less than one-tenth of the memory. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of High Performance Computing Applications is the property of Sage Publications Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Be the first to leave a comment!
You must be logged in first