Accelerating sparse Cholesky factorization on GPUs Academic Article uri icon

abstract

  • 2016 Elsevier B.V. Sparse factorization is a fundamental tool in scientific computing. As the major component of a sparse direct solver, it represents the dominant computational cost for many analyses. For factorizations which involve sufficient dense math, the substantial computational capability provided by GPUs (Graphics Processing Units) can help alleviate this cost. However, for many other cases, the prevalence of small/irregular dense math and the relatively slow communication between the host and device over the PCIe bus, make it challenging to significantly accelerate sparse factorization using the GPU. In this paper we describe a left-looking supernodal Cholesky factorization algorithm which permits improved utilization of the GPU when factoring sparse matrices. The central idea is to stream subtrees of the elimination tree through the GPU and perform the factorization of each subtree entirely on the GPU. This avoids the majority of the PCIe communication without the need for a complex task scheduler. Importantly, within these subtrees, many independent, small, dense operations are batched to minimize kernel launch overhead and many of these batched kernels are executed concurrently to maximize device utilization. Performance results for commonly studied matrices are presented along with suggested actions for further optimization.

published proceedings

  • PARALLEL COMPUTING

author list (cited authors)

  • Rennich, S. C., Stosic, D., & Davis, T. A.

complete list of authors

  • Rennich, Steven C||Stosic, Darko||Davis, Timothy A

publication date

  • January 1, 2016 11:11 AM