{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:44:55Z","timestamp":1773153895074,"version":"3.50.1"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,1]]},"abstract":"<jats:p>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 web graph 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.<\/jats:p>","DOI":"10.14778\/1938545.1938548","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"231-242","source":"Crossref","is-referenced-by-count":93,"title":["Fast sparse matrix-vector multiplication on GPUs"],"prefix":"10.14778","volume":"4","author":[{"given":"Xintian","family":"Yang","sequence":"first","affiliation":[{"name":"Ohio State University, Columbus, OH"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, OH"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, OH"}]}],"member":"320","published-online":{"date-parts":[[2011,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693470"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/17445760802337010"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693471"},{"key":"e_1_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. Stein , R. L. Rivest , and C. E. Leiserson . Introduction to Algorithms . McGraw-Hill , 2001 . T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill, 2001."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555775"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397742"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00107510500052444"},{"key":"e_1_2_1_13_1","unstructured":"NVIDIA. Nvidia cuda programming guide 2.0. www.nvidia.com.  NVIDIA. Nvidia cuda programming guide 2.0. www.nvidia.com."},{"key":"e_1_2_1_14_1","unstructured":"NVIDIA. Optimize matrix transpose in cuda. www.nvidia.com.  NVIDIA. Optimize matrix transpose in cuda. www.nvidia.com."},{"key":"e_1_2_1_16_1","volume-title":"Next Generation of Data Mining","author":"Parthasarathy S.","year":"2008","unstructured":"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 . 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."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011656"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0094-2"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.12.006"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1938545.1938548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:45:54Z","timestamp":1672224354000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1938545.1938548"}},"subtitle":["implications for graph mining"],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["10.14778\/1938545.1938548"],"URL":"https:\/\/doi.org\/10.14778\/1938545.1938548","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}