{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:09:31Z","timestamp":1729613371200,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/hipc.2013.6799135","type":"proceedings-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:26:14Z","timestamp":1399040774000},"page":"286-294","source":"Crossref","is-referenced-by-count":10,"title":["Efficient sparse matrix multiple-vector multiplication using a bitmapped format"],"prefix":"10.1109","author":[{"given":"Ramaseshan","family":"Kannan","sequence":"first","affiliation":[]}],"member":"263","reference":[{"journal-title":"Intel Math Kernel Library (IntelMKL)","year":"2012","key":"15"},{"year":"0","author":"fog","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"journal-title":"Oasys GSA suite","year":"0","key":"11"},{"journal-title":"Using de Bruijn Sequences to Index A 1 in A Computer World","year":"0","author":"leiserson","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971538"},{"key":"2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/977091.977115","article-title":"Reflections on the memory wall","author":"mckee","year":"2004","journal-title":"Proceedings of the 1st Conference on Computing Frontiers Ser CF '04"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/216585.216588"},{"key":"10","first-page":"721","article-title":"Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication","author":"buluc","year":"2011","journal-title":"International Parallel & Distributed Processing Symposium (IPDPS) IEEE International"},{"key":"7","article-title":"Performance optimizations and bounds for sparse matrix-vector multiply","author":"vuduc","year":"2002","journal-title":"Proceedings of Supercomputing"},{"key":"6","first-page":"127","article-title":"Optimizing sparse matrix computations for register reuse in SPARSITY","volume":"2073","author":"im","year":"2001","journal-title":"Proceedings of the International Conference on Computational Science Ser LNCS"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1145\/331532.331562","article-title":"Improving performance of sparse matrix-vector multiplication","author":"pinar","year":"1999","journal-title":"Proceedings of the 1999 ACM\/IEEE Conference on Supercomputing (CDROM) Ser Supercomputing '99"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1147\/rd.416.0711"},{"year":"0","key":"9"},{"journal-title":"Performance Optimizations and Bounds for Sparse Symmetric Matrixmultiple Vector Multiply","year":"2003","author":"lee","key":"8"}],"event":{"name":"2013 20th International Conference on High Performance Computing (HiPC)","start":{"date-parts":[[2013,12,18]]},"location":"Bengaluru (Bangalore), Karnataka, India","end":{"date-parts":[[2013,12,21]]}},"container-title":["20th Annual International Conference on High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6784161\/6799095\/06799135.pdf?arnumber=6799135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:20:41Z","timestamp":1648909241000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6799135\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/hipc.2013.6799135","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}