{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:26:32Z","timestamp":1759134392439},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"The Scientific and Technological Research Council of Turkey TUBITAK","award":["EEEAG-114E545"],"award-info":[{"award-number":["EEEAG-114E545"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1109\/tpds.2016.2577024","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T18:06:35Z","timestamp":1465236395000},"page":"1-1","source":"Crossref","is-referenced-by-count":4,"title":["A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously"],"prefix":"10.1109","author":[{"given":"Oguz","family":"Selvitopi","sequence":"first","affiliation":[]},{"given":"Seher","family":"Acer","sequence":"additional","affiliation":[]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","article-title":"PETSc users manual","author":"balay","year":"2014","journal-title":"Tech Rep ANL-95\/11 - Revision 3 5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","author":"lengauer","year":"1990","journal-title":"Combinatorial Algorithms for Integrated Circuit Layout"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.62"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.20"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1137\/S1064827502410463","article-title":"Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies","volume":"25","author":"u\u00e7ar","year":"2004","journal-title":"SIAM J Sci Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.12.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2013.05.003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1142\/S0129053395000051"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SHPCC.1994.296689"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169788"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0914033"},{"key":"ref19","first-page":"503","article-title":"Challenges and advances in parallel sparse matrix-matrix multiplication","author":"bulu\u00e7","year":"2008","journal-title":"Proc 37th Int Conf Parallel Process"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/368434.368865"},{"key":"ref4","first-page":"2048","article-title":"Partitioning rectangular and structurally unsymmetric sparse matrices for parallel processing","author":"hendrickson","year":"1999","journal-title":"SIAM J Sci Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61142-8_588"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00048-X"},{"key":"ref6","first-page":"296","article-title":"Parallel multilevel algorithms for multi-constraint graph partitioning","volume":"1900","author":"schloegel","year":"2000","journal-title":"Proc 6th Int Euro-ParConf Parallel Process"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09766-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref8","first-page":"28","article-title":"A hypergraph-partitioning approach for coarse-grain decomposition","author":"\u00e7ataly\u00fcrek","year":"2001","journal-title":"Proc ACM\/IEEE Conf Supercomputing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018541"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1137\/060662459","article-title":"Revisiting hypergraph models for sparse matrix partitioning","volume":"49","author":"u\u00e7ar","year":"2007","journal-title":"SIAM Rev"},{"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":"ref20","first-page":"65:1","article-title":"Parallel breadth-first search on distributed memory systems","author":"bulu\u00e7","year":"2011","journal-title":"Proc Int Conf High Perform Comput Netw Storage Anal"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/080737770"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063469"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2311804"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503293"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.04.004"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/4359390\/07485866.pdf?arnumber=7485866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:12:51Z","timestamp":1642003971000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7485866\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/tpds.2016.2577024","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2016]]}}}