Publication Details

Fast Radix Sort for Sparse Linear Algebra on GPU

POLOK, L.; ILA, V.; SMRŽ, P. Fast Radix Sort for Sparse Linear Algebra on GPU. Proceedings of the 22nd High Performance Computing Symposium (HPC'14). Tampa: Association for Computing Machinery, 2014. p. 1-8. ISBN: 1-56555-353-5.
Czech title
Rychlé radixové řazení pro řídkou lineární algebru na GPU
Type
conference paper
Language
English
Authors
Polok Lukáš, Ing., Ph.D.
Ila Viorela Simona, Ph.D.
Smrž Pavel, doc. RNDr., Ph.D. (DCGM)
URL
Keywords

Parallel sorting, radix sort, sparse matrix, matrix-matrix multiplication.

Abstract

Fast sorting is an important step in many parallel algorithms, which require data ranking, ordering or partitioning. Parallel sorting is a widely researched subject, and many algorithms were developed in the past. In this paper, the focus is on implementing highly efficient sorting routines for the sparse linear algebra operations, such as parallel sparse matrix - matrix multiplication, or factorization. We propose a fast and simple to implement variant of parallel radix sort algorithm, suitable for GPU architecture.

Published
2014
Pages
1–8
Proceedings
Proceedings of the 22nd High Performance Computing Symposium (HPC'14)
ISBN
1-56555-353-5
Publisher
Association for Computing Machinery
Place
Tampa
BibTeX 
@inproceedings{BUT111565,
  author="Lukáš {Polok} and Viorela Simona {Ila} and Pavel {Smrž}",
  title="Fast Radix Sort for Sparse Linear Algebra on GPU",
  booktitle="Proceedings of the 22nd High Performance Computing Symposium (HPC'14)",
  year="2014",
  pages="1--8",
  publisher="Association for Computing Machinery",
  address="Tampa",
  isbn="1-56555-353-5",
  url="http://dl.acm.org/citation.cfm?id=2663521"
}
Back to top