Detail publikace

Fast Sparse Matrix Multiplication on GPU

POLOK, L. ILA, V. SMRŽ, P.

Originální název

Fast Sparse Matrix Multiplication on GPU

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

Sparse matrix multiplication is an important algorithm in a wide variety of problems, including graph algorithms, simulations and linear solving to name a few. Yet, there are but a few works related to acceleration of sparse matrix multiplication on a GPU. We present a fast, novel algorithm for sparse matrix multiplication, outperforming the previous algorithm on GPU up to 3x and CPU up to 30x. The principal improvements include more efficient load balancing strategy, and a faster sorting algorithm. The main contribution is design and implementation of efficient sparse matrix multiplication algorithm and extending it to sparse block matrices, which is to our best knowledge the first implementation of this kind.

Klíčová slova

parallel sparse matrix multiplication, parallel linear algebra, matrix-matrix multiplication, GPGPU

Autoři

POLOK, L.; ILA, V.; SMRŽ, P.

Rok RIV

2015

Vydáno

11. 3. 2015

Nakladatel

Association for Computing Machinery

Místo

Alexandria, Virginia

ISBN

978-1-5108-0101-1

Kniha

Proceedings of the 23rd High Performance Computing Symposium (HPC'15)

Strany od

1

Strany do

8

Strany počet

8

URL

http://dl.acm.org/citation.cfm?id=2872604

BibTex

@inproceedings{BUT119833,
  author="Lukáš {Polok} and Viorela Simona {Ila} and Pavel {Smrž}",
  title="Fast Sparse Matrix Multiplication on GPU",
  booktitle="Proceedings of the 23rd High Performance Computing Symposium (HPC'15)",
  year="2015",
  pages="1--8",
  publisher="Association for Computing Machinery",
  address="Alexandria, Virginia",
  isbn="978-1-5108-0101-1",
  url="http://dl.acm.org/citation.cfm?id=2872604"
}