Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds.
Hussam Al DaasGrey BallardLaura GrigoriSuraj KumarKathryn RousePublished in: SPAA (2022)
Keyphrases
- lower bound
- matrix multiplication
- distributed memory
- upper bound
- multithreading
- shared memory
- message passing
- branch and bound
- parallel implementation
- worst case
- branch and bound algorithm
- np hard
- lower and upper bounds
- objective function
- optimal solution
- parallel hardware
- parallel computing
- parallel processing
- vc dimension
- parallel machines
- matrix factorization
- main memory
- high resolution
- data structure