{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T09:45:22Z","timestamp":1785577522432,"version":"3.56.0"},"reference-count":80,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["P202\/12\/2011"],"award-info":[{"award-number":["P202\/12\/2011"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2016,2,1]]},"DOI":"10.1109\/tpds.2015.2401575","type":"journal-article","created":{"date-parts":[[2015,2,9]],"date-time":"2015-02-09T19:24:13Z","timestamp":1423509853000},"page":"428-440","source":"Crossref","is-referenced-by-count":111,"title":["Evaluation Criteria for Sparse Matrix Storage Formats"],"prefix":"10.1109","volume":"27","author":[{"given":"Daniel","family":"Langr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel","family":"Tvrdik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","author":"mccalpin","year":"0"},{"key":"ref72","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/11557654_91","article-title":"Fast sparse matrix-vector multiplication by exploiting variable block structure","volume":"3726","author":"vuduc","year":"2005","journal-title":"High Performance Computing and Communications"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.01.014"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1177\/1094342010374847"},{"key":"ref76","author":"jeffers","year":"2013","journal-title":"Intel Xeon Phi Coprocessor High-performance Programming"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4302-5927-5"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1366230.1366244","article-title":"Optimizing sparse matrix-vector multiplication using index and value compression","author":"kourtis","year":"2008","journal-title":"Proceedings of the 5th Conference on Computing Frontiers"},{"key":"ref75","article-title":"An empirical study of Intel Xeon Phi","volume":"abs 1310 5842","author":"fang","year":"2013","journal-title":"CoRR"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.62"},{"key":"ref78","article-title":"Performance evaluation of sparse matrix multiplication kernels on Intel Xeon Phi","volume":"abs 1302 1078","author":"saule","year":"2013","journal-title":"CoRR"},{"key":"ref79","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-19328-6_1","article-title":"Exascale computing technology challenges","volume":"6449","author":"shalf","year":"2011","journal-title":"Proc 2010 High Performance Computing for Computational Science"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/1583991.1584053","article-title":"Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks","author":"bulu\u00e7","year":"2009","journal-title":"Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/120900216"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11752578_21"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2012.68"},{"key":"ref37","first-page":"161","article-title":"Space-efficient sparse matrix storage formats with 8-bit indices","author":"\u0161ime?ek","year":"0","journal-title":"Proc Seminar Numer Anal"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.219"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941587"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.290"},{"key":"ref60","first-page":"300","article-title":"Utilizing recursive storage in sparse matrix-vector multiplication—preliminary considerations","author":"martone","year":"0","journal-title":"Proc ISCA 25th Int Conf Comput Their Appl"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29843-1_69"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/IMCSIT.2010.5680036"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.03.008"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693471"},{"key":"ref64","first-page":"447","article-title":"New row-grouped CSR format for storing the sparse matrices on GPU with implementation in CUDA","volume":"56","author":"oberhuber","year":"2011","journal-title":"Acta Tech"},{"key":"ref27","article-title":"Sparse matrix vector processing formats","author":"stathis","year":"2004"},{"key":"ref65","article-title":"Automatic performance tuning of sparse matrix kernels","author":"vuduc","year":"2003"},{"key":"ref66","author":"kreutzer","year":"2013","journal-title":"CoRR"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2597652.2597678"},{"key":"ref67","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-11515-8_10","article-title":"Automatically tuning sparse matrix-vector multiplication for GPU architectures","volume":"5952","author":"monakov","year":"2010","journal-title":"High Performance Embedded Architectures and Compilers"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.2528\/PIER11031607"},{"key":"ref69","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-540-68111-3_17","article-title":"Sparse matrix-vector multiplication—final solution?","author":"\u0161ime?ek","year":"2008","journal-title":"Proceedings of the 7th International Conference on Parallel Processing and Applied Mathematics"},{"key":"ref2","article-title":"Efficient sparse matrix-vector multiplicatoin on CUDA","author":"bell","year":"2008"},{"key":"ref1","author":"asanovic","year":"2006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.10"},{"key":"ref22","first-page":"54","article-title":"Space-efficient sparse matrix storage formats for massively parallel systems","author":"\u0161ime?ek","year":"2012","journal-title":"Proceedings of the 14th IEEE International Conference of High Performance Computing and Communications (HPCC 2012)"},{"key":"ref21","volume":"abs 1203 5737","author":"heller","year":"2012","journal-title":"CoRR"},{"key":"ref24","first-page":"1","article-title":"Tree-based space efficient formats for storing the structure of sparse matrices","volume":"15","author":"\u0161ime?ek","year":"2014","journal-title":"Scalable Comput Pract Exp"},{"key":"ref23","first-page":"344","article-title":"Space efficient formats for structure of sparse matrices based on tree structures","author":"\u0161ime?ek","year":"2013","journal-title":"Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Sci Computing (SYNASC 2013)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555255"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.03.002"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213156"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/IMCSIT.2010.5680039"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2010.77"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2010.72"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-010-0145-2"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542294"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.211"},{"key":"ref53","first-page":"359","article-title":"Minimal quadtree format for compression of sparse matrices storage","author":"\u0161ime?ek","year":"0","journal-title":"Proc 14th Int Symp Symbolic Numer Algorithms Sci Comput"},{"key":"ref52","first-page":"2028","article-title":"An improved sparse matrix-vector multiplication kernel for solving modified equation in large scale power flow calculation on CUDA","volume":"3","author":"yang","year":"0","journal-title":"Proc 7th Int Power Electron Motion Control Conf"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/216585.216588"},{"key":"ref11","article-title":"ExaScale computing study: Technology challenges in achieving exascale systems","author":"kogge","year":"2008"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1880037.1880041"},{"key":"ref12","article-title":"The opportunities and challenges of exascale computing","author":"ashby","year":"2010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971538"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"ref16","article-title":"ITPACK 2.0: User's Guide","author":"grimes","year":"0"},{"key":"ref17","first-page":"545","article-title":"Adaptive-blocking hierarchical storage format for sparse matrices","author":"langr","year":"0","journal-title":"Proc IEEE Federated Conf Comput Sci Inf Syst"},{"key":"ref18","first-page":"479","article-title":"Storing sparse matrices in the adaptive-blocking hierarchical storage format","author":"langr","year":"0","journal-title":"Proc IEEE Federated Conf Comput Sci Inf Syst"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/SC.2014.69","article-title":"Fast sparse matrix-vector multiplication on GPUs for graph applications","author":"ashari","year":"2014","journal-title":"Proceedings of the International Conference for High Performance Computing Networking Storage and Analysis"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/584091.584093"},{"key":"ref4","article-title":"SpMV: A memory-bound application on the GPU stuck between a rock and a hard place","author":"davis","year":"2012"},{"key":"ref3","article-title":"Autotuning sparse matrix-vector multiplication for multicore","author":"byun","year":"2012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2010.02.003"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2574","DOI":"10.1016\/j.jpdc.2014.02.005","article-title":"What is ahead for parallel computing","volume":"74","author":"hwu","year":"2014","journal-title":"J Parallel Distrib Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.12.006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2465013"},{"key":"ref49","first-page":"445","article-title":"Sparse matrix storage format","author":"smailbegovic","year":"0","journal-title":"Proc 16th Annu Workshop Circuits Syst Signal Proc"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"ref46","first-page":"v11?161","article-title":"Implementing sparse matrix-vector multiplication using CUDA based on a hybrid sparse matrix format","volume":"11","author":"cao","year":"0","journal-title":"Proc Int Conf Comput Appl Syst Modeling"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1658"},{"key":"ref48","article-title":"GPU accelerated sparse matrix-vector multiplication and sparse matrix-transpose vector multiplication","author":"tao","year":"2014","journal-title":"Concurrency Comput Practice Exp"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2010.208"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.223"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2011.91"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2011.08.004"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183444"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7383375\/7036061.pdf?arnumber=7036061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:52:43Z","timestamp":1691175163000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7036061\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":80,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2015.2401575","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2016,2,1]]}}}