The performance of parallel algorithms for sparse matrixmatrix multiplication is typically determined by the amount of interprocessor communication performed, which in turn depends on the nonzero structure of the input matrices. In this paper, we characterize the communication cost of a sparse matrix-matrix multiplication algorithm in terms of the size of a cut of an associated hypergraph that encodes the computation for a given input nonzero structure. Obtaining an optimal algorithm corresponds to solving a hypergraph partitioning problem. Our hypergraph model generalizes several existing models for sparse matrix-vector multiplication, and we can leverage hypergraph partitioners developed for that computation to improve applicationspecific algorithms for multiplying sparse matrices.
|Original language||American English|
|Title of host publication||SPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures|
|Publisher||Association for Computing Machinery|
|Number of pages||3|
|State||Published - 13 Jun 2015|
|Event||27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015 - Portland, United States|
Duration: 13 Jun 2015 → 15 Jun 2015
|Name||Annual ACM Symposium on Parallelism in Algorithms and Architectures|
|Conference||27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015|
|Period||13/06/15 → 15/06/15|
Bibliographical notePublisher Copyright:
Copyright © 2015 ACM.