{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:51:08Z","timestamp":1770990668396,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001348","name":"Agency for Science, Technology and Research","doi-asserted-by":"publisher","award":["102-101-0028"],"award-info":[{"award-number":["102-101-0028"]}],"id":[{"id":"10.13039\/501100001348","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2015,9,1]]},"DOI":"10.1109\/tpds.2014.2357437","type":"journal-article","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T14:34:31Z","timestamp":1410446071000},"page":"2373-2385","source":"Crossref","is-referenced-by-count":16,"title":["A Family of Bit-Representation-Optimized Formats for Fast Sparse Matrix-Vector Multiplication on the GPU"],"prefix":"10.1109","volume":"26","author":[{"given":"Wai Teng","family":"Tang","sequence":"first","affiliation":[]},{"given":"Wen Jun","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Rick Siow Mong","family":"Goh","sequence":"additional","affiliation":[]},{"given":"Stephen John","family":"Turner","sequence":"additional","affiliation":[]},{"given":"Weng-Fai","family":"Wong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555255"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542294"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/11557654_91"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2011.08.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183444"},{"key":"ref12","first-page":"87","article-title":"Optimizing sparse matrix-vector multiplication using index and value compression","author":"kourtis","year":"0","journal-title":"Proc 5th Conf Comput Front"},{"key":"ref13","year":"0"},{"key":"ref14","first-page":"97","article-title":"Scan primitives for GPU computing","author":"sengupta","year":"0","journal-title":"Proc 22nd ACM SIGGRAPH\/EUROGRAPHICS symposium on Graphics hardware"},{"key":"ref15","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2159430.2159436"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503234"},{"key":"ref18","year":"0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/InPar.2012.6339599"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1964179.1964196"},{"key":"ref4","first-page":"99","article-title":"Vectorized sparse matrix multiply for compressed row storage format","author":"d\u2019azevedo","year":"0","journal-title":"Proc 5th Int Conf Comput Sci —Vol Part I"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304624"},{"key":"ref3","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"key":"ref29","first-page":"127","article-title":"Optimizing sparse matrix computations for register reuse in SPARSITY","author":"im","year":"0","journal-title":"Proc Int Conf Comput Sci -Part I"},{"key":"ref5","article-title":"Optimizing sparse matrix-vector multiplication on GPUs","author":"baskaran","year":"2009"},{"key":"ref8","first-page":"111","article-title":"Automatically tuning sparse matrix-vector multiplication for GPU architectures","author":"monakov","year":"0","journal-title":"Proc 5th Int Conf High Perform Embedded Arch Compilers"},{"key":"ref7","year":"0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362674"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1658"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.2002.7176"},{"key":"ref22","author":"im","year":"2000","journal-title":"Optimizing the performance of sparse matrix-vector multiplication"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594271421"},{"key":"ref24","article-title":"Improving performance of sparse matrix-vector multiplication","author":"pinar","year":"0","journal-title":"Proc ACM\/IEEE Conf Supercomput"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004038951"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693471"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/16\/1\/071"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7180482\/06895301.pdf?arnumber=6895301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:32Z","timestamp":1641987692000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6895301\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,1]]},"references-count":32,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2014.2357437","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2015,9,1]]}}}