On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal Matrix Factorizations

Matrix factorizations are among the most important building blocks of scientific computing. However, state-of-the-art libraries are not communication-optimal, underutilizing current parallel architectures. We present novel algorithms for Cholesky and LU factorizations that utilize an asymptotically...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SC21: International Conference for High Performance Computing, Networking, Storage and Analysis S. 1 - 15
Hauptverfasser:	Kwasniewski, Grzegorz, Kabic, Marko, Ben-Nun, Tal, Ziogas, Alexandros Nikolaos, Saethre, Jens Eirik, Gaillard, Andre, Schneider, Timo, Besta, Maciej, Kozhevnikov, Anton, VandeVondele, Joost, Hoefler, Torsten
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	ACM 14.11.2021
Schlagworte:	Codes communication complexity Distributed linear algebra algorithms Layout Libraries matrix factorization Schedules Scientific computing Supercomputers Three-dimensional displays
ISSN:	2167-4337
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!