Red-Blue Pebbling Revisited: Near Optimal Parallel Matrix-Matrix Multiplication

We propose COSMA: a parallel matrix-matrix multiplication algorithm that is near communication-optimal for all combinations of matrix dimensions, processor counts, and memory sizes. The key idea behind COSMA is to derive an optimal (up to a factor of 0.03% for 10MB of fast memory) sequential schedul...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SC19: International Conference for High Performance Computing, Networking, Storage and Analysis S. 1 - 22
Hauptverfasser:	Kwasniewski, Grzegorz, Kabic, Marko, Besta, Maciej, VandeVondele, Joost, Solca, Raffaele, Hoefler, Torsten
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	ACM 17.11.2019
Schlagworte:	Games Lower bound Manuals Matrix decomposition Memory management Optimization Schedules Sparse matrices Three-dimensional displays Tuning
ISSN:	2167-4337
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!