Skip to main content
eScholarship
Open Access Publications from the University of California

Communication-Avoiding Parallel Sparse-Dense Matrix-Matrix Multiplication

  • Author(s): Koanantakool, P
  • Azad, A
  • Buluc, A
  • Morozov, D
  • Oh, SY
  • Oliker, L
  • Yelick, K
  • et al.

Published Web Location

https://people.eecs.berkeley.edu/~yelick/papers/spdmmm16.pdf
No data is associated with this publication.
Abstract

Multiplication of a sparse matrix with a dense matrix is a building block of an increasing number of applications in many areas such as machine learning and graph algorithms. However, most previous work on parallel matrix multiplication considered only both dense or both sparse matrix operands. This paper analyzes the communication lower bounds and compares the communication costs of various classic parallel algorithms in the context of sparse-dense matrix-matrix multiplication. We also present new communication-avoiding algorithms based on a 1D decomposition, called 1.5D, which - while suboptimal in dense-dense and sparse-sparse cases - outperform the 2D and 3D variants both theoretically and in practice for sparse-dense multiplication. Our analysis separates one-time costs from per iteration costs in an iterative machine learning context. Experiments demonstrate speedups up to 100x over a baseline 3D SUMMA implementation and show parallel scaling over 10 thousand cores.

Item not freely available? Link broken?
Report a problem accessing this item