{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:14:05Z","timestamp":1759133645958,"version":"3.37.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Center for High Performance Computing of Turkey","award":["4005072018"],"award-info":[{"award-number":["4005072018"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2020,6,1]]},"DOI":"10.1109\/tpds.2020.2964536","type":"journal-article","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:46:55Z","timestamp":1578430015000},"page":"1461-1473","source":"Crossref","is-referenced-by-count":1,"title":["Reduce Operations: Send Volume Balancing While Minimizing Latency"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0298-3034","authenticated-orcid":false,"given":"M. Ozan","family":"Karsavuran","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3951-3930","authenticated-orcid":false,"given":"Seher","family":"Acer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4559-1321","authenticated-orcid":false,"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3155292"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2577024"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.08.005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.10.001"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/588\/11704","article-title":"UMPa: A multi-objective, multi-level partitioner for communication minimization","volume":"588","author":"\u00e7ataly\u00fcrek","year":"2013","journal-title":"Graph Partitioning Graph Clustering"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.12.002"},{"journal-title":"Introduction to Parallel Computing","year":"1994","author":"kumar","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827598341475"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"ref3","first-page":"47","article-title":"Communication balancing in parallel sparse matrix-vector multiplication","volume":"21","author":"bisseling","year":"2005","journal-title":"Electron Trans Numerical Anal"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.62"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2013.05.003"},{"key":"ref8","first-page":"926","article-title":"Minimizing communication cost in fine-grain partitioning of sparse matrices","author":"u\u00e7ar","year":"2003","journal-title":"Proc Int Symp Comput Inf Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502410463"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/080737770"},{"key":"ref1","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.04.004"},{"article-title":"A library for parallel sparse matrix-vector multiplies","year":"2005","author":"u\u00e7ar","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8965249\/08951280.pdf?arnumber=8951280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:34Z","timestamp":1651070434000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8951280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,1]]},"references-count":21,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2020.2964536","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2020,6,1]]}}}