Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining

Details Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining

2011-03-12

arxiv.org/abs/1103.2405v1

Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 4, pp. 231-242 (2011)

Computer Science

Databases

VLDB2011

Scientific paper

Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In this article we present a novel non-parametric, self-tunable, approach to data representation for computing this kernel, particularly targeting sparse matrices representing power-law graphs. Using real data, we show how our representation scheme, coupled with a novel tiling algorithm, can yield significant benefits over the current state of the art GPU efforts on a number of core data mining algorithms such as PageRank, HITS and Random Walk with Restart.

Affiliated with

Also associated with

No associations

Rating

Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278581