Fast sparse matrix-vector multiplication on GPUs: Implications for graph mining

Proceedings of the VLDB Endowment

Volumn 4, Issue 4, 2011, Pages 231-242

  Yang, Xintian ^a   Parthasarathy, Srinivasan ^a   Sadayappan, P ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; DATA MINING; GRAPH THEORY; GRAPHICS PROCESSING UNIT; PROGRAM PROCESSORS;

DATA REPRESENTATIONS; NON-PARAMETRIC; POWER LAW GRAPHS; RANDOM WALK WITH RESTART; REPRESENTATION SCHEMES; SPARSE MATRICES; SPARSE MATRIX-VECTOR MULTIPLICATION; STATE OF THE ART;

MATRIX ALGEBRA;

EID: 84862123284     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1938545.1938548     Document Type: Article

References (20)

1. S. S. Baghsorkhi, M. Delahaye, S. J. Patel, W. D. Gropp, and W.-m. W. Hwu. An adaptive performance modeling tool for gpu architectures. In PPoPP, pages 105-114, 2010.
2. M. M. Baskaran and R. Bordawekar. Optimizing sparse matrix-vector multiplication on gpus. Technical Report RC24704, IBM, 2008.
3. N. Bell and M. Garland. Implementing sparse matrix-vector multiplication on throughput-oriented processors. In SC, pages 1-11, 2009.
4. P. Boldi, B. Codenotti, M. Santini, and S. Vigna. Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience, 34(8):711-726, 2004.
5. L. Buatois, G. Caumon, and B. Levy. Concurrent number cruncher: a gpu implementation of a general sparse linear solver. Int. J. Parallel Emerg. Distrib. Syst., 24(3):205-223.
6. J. W. Choi, A. Singh, and R. Vuduc. Model-driven autotuning of sparse matrix-vector multiply on gpus. In PPOPP, pages 115-126, 2010.
7. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill, 2001.
8. S. Hong and H. Kim. An analytical model for gpu architecture with memory-level and thread-level parallelism awareness. SIGARCH Comput. Archit. News, 37(3):152-163.
9. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998.
10. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of ACM, 46(5):604-632, 1999.
11. A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Growth of the ickr social network. In WOSN, pages 25-30, 2008.
12. M. E. J. Newman. Power laws, pareto distributions and zipf's law. Contemporary Physics, 46:323-351, 2005.
13. NVIDIA. Nvidia cuda programming guide 2.0. www.nvidia.com.
14. NVIDIA. Optimize matrix transpose in cuda. www.nvidia.com.
15. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab.
16. S. Parthasarathy, S. Tatikonda, G. Buehrer, and A. Ghoting. Architecture conscious data mining: Current directions and future outlook. In Next Generation of Data Mining. Chapman and Hall, 2008.
17. S. Parthasarathy, M. J. Zaki, M. Ogihara, and W. Li. Parallel data mining for association rules on shared memory systems. Knowl. Inf. Syst., 3(1):1-29, 2001.
18. H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: fast solutions and applications. Knowl. Inf. Syst., 14(3):327-346, 2008.
19. R. W. Vuduc. Automatic performance tuning of sparse matrix kernels. PhD thesis, University of California, Berkeley, 2003.
20. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. Parallel Computing, 35(3):178-194, 2009.