arrow
Return

A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems

delete2019-09-01
delete11
delete
OA
AI
P
Piyush Sao *
X
Xiaoye Sherry Li
R
Richard Vuduc
DOI:10.1016/j.jpdc.2019.03.004delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D algorithm for sparse LU uses a three-dimensional MPI process grid, exploits elimination tree parallelism, and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., those arising from 2D grid or mesh discretizations) and certain non-planar graphs (specifically for 3D grids and meshes). For a planar graph with n vertices, our algorithm reduces communication volume asymptotically in n by a factor of 0 (root log n) and latency by a factor of 0 (log n). For non planar cases, our algorithm can reduce the per-process communication volume by 3x and latency by o (n(1/3)) times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in SuPERLU_DIST. Our new 3D code achieves empirical speedups up to 27x for planar graphs and up to 3.3x for non-planar graphs over the baseline 2D SuPERLU_DIST when run on 24,000 cores of a Cray XC30. We extend the 3D algorithm for heterogeneous architectures by adding the Highly Asynchronous Lazy Offload (HALO) algorithm for co-processor offload [44]. On 4096 nodes of a Cray XK7 with 32,768 CPU cores and 4096 Nvidia K20x GPUs, the 3D algorithm achieves empirical speedups up to 24x for planar graphs and 3.5x for non-planar graphs over the baseline 2D SuPERLU_DIST with co-processor acceleration. (C) 2019 Elsevier Inc. All rights reserved.
Keywords:
PARALLEL ALGORITHMS
SEPARATOR THEOREM
DIRECT SOLVER
SUPERLU
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Parallel and Distributed Computing cover
Journal of Parallel and Distributed Computing
IF:
4
Papers:
3.8K
Citations:
4.8K

Organization

U
united states department of energy (doe)
Scholars:
11.3W
Papers: 9.6W
Citations: 246
O
oak ridge national laboratory
Scholars:
1.5W
Papers: 1.0W
Citations: 20
Cited Papers

Cited Papers

Molecular Identification and Characterization of Plasmodium ovale curtisi in Field Isolates from Symptomatic Children in North-Central Nigeria
err2021-03-12
err0
PREAI
errSegun Isaac Oyedeji; Henrietta Oluwatoyin Awobode; Olusola Ojurongbe; Chiaka Anumudu; Peter Usman Bassi
errShare
errSave
errShare
errSave
Pre-pregnancy body mass index and the risk of adverse outcome in type 1 diabetic pregnancies: a population-based cohort study
err2012-02-14
err0
errOAAI
errMartina Persson; Dharmintra Pasupathy; Ulf Hanson; Magnus Westgren; Mikael Norman
errShare
errSave
errShare
errSave
SymPy: symbolic computing in Python
err2017-01-02
err1.1K
errOAAI
errMeurer, Aaron; Smith, Christopher P.; Paprocki, Mateusz; Certik, Ondrej; Kirpichev, Sergey B.; Rocklin, Matthew; Kumar, AMiT; Ivanov, Sergiu; Moore, Jason K.; Singh, Sartaj; Rathnayake, Thilina; Vig, Sean; Granger, Brian E.; Muller, Richard P.; Bonazzi, Francesco; Gupta, Harsh; Vats, Shivam; Johansson, Fredrik; Pedregosa, Fabian; Curry, Matthew J.; Terrel, Andy R.; Roucka, Stepan; Saboo, Ashutosh; Fernando, Isuru; Kulal, Sumith; Cimrman, Robert; Scopatz, Anthony
errShare
errSave
researcher View more