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...

Celý popis

Podrobná bibliografia

Vydané v:	2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) s. 908 - 919
Hlavní autori:	Sao, Piyush, Li, Xiaoye Sherry, Vuduc, Richard
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.05.2018
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!