{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:12:44Z","timestamp":1740100364816,"version":"3.37.3"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/nas51552.2021.9605433","type":"proceedings-article","created":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T21:12:15Z","timestamp":1637615535000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["GO: Out-Of-Core Partitioning of Large Irregular Graphs"],"prefix":"10.1109","author":[{"given":"Gurneet","family":"Kaur","sequence":"first","affiliation":[{"name":"UC Riverside,CSE Dept."}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"UC Riverside,CSE Dept."}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29778-1_1"},{"key":"ref12","first-page":"31","article-title":"Graphchi: Large-scale graph computation on just a pc","author":"kyrola","year":"2012","journal-title":"USENIX Symposium on Operating Systems Design and Implementation"},{"article-title":"Stanford large network dataset collection","year":"2011","author":"leskovec","key":"ref13"},{"key":"ref14","article-title":"Multithreaded Graph Partitioning","author":"lasalle","year":"2013","journal-title":"IEEE International Parallel and Distributed Processing Symposium"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833188"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61142-8_588"},{"key":"ref4","article-title":"Powergraph: Distributed graph-parallel computation on natural graphs","author":"gonzalez","year":"2012","journal-title":"USENIX Symposium on Operating Systems Design and Implementation"},{"year":"0","key":"ref27","article-title":"Google’s data interchange format"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388998"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224228"},{"article-title":"A Multilevel Algorithm for Partitioning Graphs","year":"1993","author":"hendrickson","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3298989"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369103"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"ref20","article-title":"Distributed evolutionary graph partitioning","author":"sanders","year":"2011","journal-title":"CoRR"},{"key":"ref22","first-page":"429","article-title":"LUMOS: Dependency-Driven Disk-based Graph Processing","author":"vora","year":"2019","journal-title":"USENIX Annual Technical Conference"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00046-6"},{"key":"ref23","first-page":"507","article-title":"Load the edges you need: A generic i\/o optimization for disk-based graph processing","author":"vora","year":"2016","journal-title":"USENIX Annual Technical Conference"},{"year":"0","key":"ref26","article-title":"Konect"},{"key":"ref25","first-page":"375","article-title":"GridGraph: Large-Scale Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning","author":"zhu","year":"2015","journal-title":"USENIX Annual Technical Conference"}],"event":{"name":"2021 IEEE International Conference on Networking, Architecture and Storage (NAS)","start":{"date-parts":[[2021,10,24]]},"location":"Riverside, CA, USA","end":{"date-parts":[[2021,10,26]]}},"container-title":["2021 IEEE International Conference on Networking, Architecture and Storage (NAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9605358\/9605359\/09605433.pdf?arnumber=9605433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T02:19:58Z","timestamp":1657333198000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9605433\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/nas51552.2021.9605433","relation":{},"subject":[],"published":{"date-parts":[[2021,10]]}}}