A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D sparse LU algorithm uses a three-dimensional MPI process grid, aggressively exploits elimination tree parallelism and trades off increased memory for reduced pe...

Full description

Bibliographic Details

Published in:	2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) pp. 908 - 919
Main Authors:	Sao, Piyush, Li, Xiaoye Sherry, Vuduc, Richard
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2018
Subjects:	communication avoiding algorithm Matrices nested dissection Parallel processing Particle separators sparse direct solver sparse gaussian elimination Sparse matrices Three-dimensional displays Transmission line matrix methods Two dimensional displays
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!