{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:05:14Z","timestamp":1725591914184},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/ccoms.2019.8821708","type":"proceedings-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T01:45:06Z","timestamp":1567475106000},"page":"351-354","source":"Crossref","is-referenced-by-count":0,"title":["Innovative Unit-Vector-Block Storage Format of Sparse Matrix and Vector"],"prefix":"10.1109","author":[{"given":"Kebing","family":"Wang","sequence":"first","affiliation":[]},{"given":"Bianny","family":"Bian","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Hao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication","author":"aydin","year":"2011","journal-title":"Parallel & Distributed Processing Symposium (IPDPS) 2011 IEEE International"},{"key":"ref11","article-title":"Optimizing sparse matrix-vector multiplication on GPUs using compile-time and run-time strategies","author":"baskaran","year":"2008","journal-title":"IBM Research Report"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2010.208"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1046192.1046202"},{"key":"ref14","article-title":"A High Memory Bandwidth FPGA Accelerator for Sparse Matrix-Vector Multiplication","author":"jeremy","year":"2014","journal-title":"2014 IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines FCCM"},{"key":"ref15","article-title":"Towards a Universal FPGA Matrix-Vector Multiplication Architecture","author":"srinidhi","year":"2012","journal-title":"Field- Programmable Custom Computing Machines (FCCM) 2012 IEEE 20th Annual International Symposium on"},{"journal-title":"Intel® ISA Extension","year":"0","key":"ref4"},{"journal-title":"Efficient Sparse Matrix-Vector Multiplication on CUDA","year":"2008","author":"bell","key":"ref3"},{"journal-title":"LIBSVM Source","year":"0","key":"ref6"},{"journal-title":"LIBSVM","year":"0","key":"ref5"},{"journal-title":"LIBSVM Data","year":"0","key":"ref8"},{"journal-title":"Intel intrinsics guide","year":"0","key":"ref7"},{"key":"ref2","first-page":"53","author":"kincaid","year":"1983","journal-title":"The ITPACK project Past present and future"},{"article-title":"Vectorized Sparse Matrix Multiply for Compressed Row Storage Format","year":"2005","author":"eduardo","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2013.6799135"}],"event":{"name":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","start":{"date-parts":[[2019,2,23]]},"location":"Singapore","end":{"date-parts":[[2019,2,25]]}},"container-title":["2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8811523\/8821628\/08821708.pdf?arnumber=8821708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:16:26Z","timestamp":1657854986000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8821708\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ccoms.2019.8821708","relation":{},"subject":[],"published":{"date-parts":[[2019,2]]}}}