{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:37:52Z","timestamp":1768030672227,"version":"3.49.0"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100004410","name":"Scientific and Technological Research Council of Turkey (TUBITAK)","doi-asserted-by":"publisher","award":["EEEAG-115E212"],"award-info":[{"award-number":["EEEAG-115E212"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2017,8,1]]},"DOI":"10.1109\/tpds.2017.2656893","type":"journal-article","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T14:12:11Z","timestamp":1485180731000},"page":"2258-2271","source":"Crossref","is-referenced-by-count":29,"title":["Exploiting Locality in Sparse Matrix-Matrix Multiplication on Many-Core Architectures"],"prefix":"10.1109","volume":"28","author":[{"given":"Kadir","family":"Akbudak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/100813956"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTERWKSP.2010.5613109"},{"key":"ref33","first-page":"33","article-title":"Fast sparse matrix multiplication on GPU","author":"polok","year":"2015","journal-title":"Proc High-Performance Comput Arch Symp"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2699470"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/110838844"},{"key":"ref30","article-title":"CUSP: Generic parallel algorithms for sparse matrix and graph computations","author":"bell","year":"2014"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/130948811"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.47"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/978-3-319-20119-1_4","article-title":"Parallel efficient sparse matrix-matrix multiplication on multicore platforms","author":"patwary et","year":"2015","journal-title":"Proc High-Performance Comput Arch Symp"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2012.6507483"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1998.669899"},{"key":"ref27","article-title":"Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication","volume":"abs 1510 844","author":"azad et","year":"2015","journal-title":"CoRR"},{"key":"ref29","year":"2014"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(95)00031-A"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4655(00)00074-6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/110848244"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/13092589X"},{"key":"ref24","article-title":"Partitioning models for scaling parallel sparse matrix-matrix multiplication","author":"akbudak","year":"0","journal-title":"ACM TOPC (under review)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755613"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486196"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2010.38"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"ref56","year":"2013"},{"key":"ref55","author":"horowitz","year":"1978","journal-title":"Fundamentals of Computer Algorithms"},{"key":"ref54","year":"2014"},{"key":"ref53","year":"2016"},{"key":"ref52","year":"2012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02024486"},{"key":"ref11","article-title":"LDRD final report on massively-parallel linear programming: The parPCx system","author":"boman","year":"2005","journal-title":"Sandia National Laboratories Albuquerque"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55224-3_52"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SUPERC.1994.344280"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719505"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1224-z"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.83"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2545664"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1063\/1.3492379"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1021\/ct200897x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4655(01)00164-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.10224"},{"key":"ref8","year":"2015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.03.012"},{"key":"ref49","article-title":"METIS manual, version 5.1","author":"karypis","year":"1998"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36803-5_14"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/71.780863","article-title":"Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication","volume":"10","author":"\u00e7ataly\u00fcrek","year":"1999","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"ref45","article-title":"hMETIS: A hypergraph partitioning package, version 1.5.3","author":"karypis","year":"1998"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/BF01720100"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/060662459"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/13093426X"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2453970"},{"key":"ref44","year":"1999","journal-title":"PaToH A Multilevel Hypergraph Partitioning Tool Version 3 0 Bilkent Univ Dept Computer Engineering"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2493123.2462916"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7979644\/07829317.pdf?arnumber=7829317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:38:36Z","timestamp":1641987516000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7829317\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,1]]},"references-count":58,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2017.2656893","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2017,8,1]]}}}