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

Full description

Bibliographic Details

Published in:	SC21: International Conference for High Performance Computing, Networking, Storage and Analysis pp. 1 - 15
Main Authors:	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:	Conference Proceeding
Language:	English
Published:	ACM 14.11.2021
Subjects:	Codes communication complexity Distributed linear algebra algorithms Layout Libraries matrix factorization Schedules Scientific computing Supercomputers Three-dimensional displays
ISSN:	2167-4337
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!