CA3DMM: A New Algorithm Based on a Unified View of Parallel Matrix Multiplication
Hua Huang, Edmond Chow
摘要
This paper presents the Communication-Avoiding 3D Matrix Multiplication (CA3DMM) algorithm, a simple and novel algorithm that has optimal or near-optimal communication cost. CA3DMM is based on a unified view of parallel matrix multiplication. Such a view generalizes 1D, 2D, and 3D matrix multiplication algorithms to reduce the data exchange volume for different shapes of input matrices. CA3DMM further minimizes the actual communication costs by carefully organizing its communication patterns. CA3DMM is much simpler than some other generalized 3D algorithms, and CA3DMM does not require low-level optimization. Numerical experiments show that CA3DMM has good parallel scalability and has similar or better performance when compared to state-of-the-art PGEMM implementations for a wide range of matrix dimensions and number of processes.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- A Sparsity-Aware Distributed-Memory Algorithm for Sparse-Sparse Matrix MultiplicationYuxi Hong, Aydin BuluçSC 2024 · 被引用 7 次
- Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU ClustersYang Liu, Nan Ding, Piyush Sao, Samuel Williams 等SC 2023 · 被引用 8 次
- Reducing communication in graph neural network trainingAlok Tripathy, Katherine A. Yelick, Aydin BuluçSC 2020 · 被引用 67 次
- MeshSlice: Efficient 2D Tensor Parallelism for Distributed DNN TrainingHyoungwook Nam, Gerasimos Gerogiannis, Josep TorrellasISCA 2025 · 被引用 3 次
- TileSpGEMM: a tiled algorithm for parallel sparse general matrix-matrix multiplication on GPUsYuyao Niu, Zhengyang Lu, Haonan Ji, Shuhui Song 等PPoPP 2022 · 被引用 66 次
