{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:19:29Z","timestamp":1753438769985,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:00:00Z","timestamp":1686009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1813173,CCF-2028714,CCF-2002554,CCF-2226448"],"award-info":[{"award-number":["CCF-1813173,CCF-2028714,CCF-2002554,CCF-2226448"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,6]]},"DOI":"10.1145\/3591195.3595268","type":"proceedings-article","created":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T20:32:43Z","timestamp":1686083563000},"page":"137-149","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["OMRGx: Programmable and Transparent Out-of-Core Graph Partitioning and Processing"],"prefix":"10.1145","author":[{"given":"Gurneet","family":"Kaur","sequence":"first","affiliation":[{"name":"University of California at Riverside, USA"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California at Riverside, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"153","volume-title":"Information Processing Letters","author":"Bui T.","year":"1992","unstructured":"T. Bui and C. Jones . Finding good approximate vertex and edge partitions is NP-hard . Information Processing Letters , pages 153 - 159 , 1992 . T. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Information Processing Letters, pages 153-159, 1992."},{"issue":"3","key":"e_1_3_2_1_2_1","first-page":"13","article-title":"Powerlyra: Differentiated graph computation and partitioning on skewed graphs","volume":"5","author":"Chen R.","year":"2019","unstructured":"R. Chen , J. Shi , Y. Chen , B. Zang , H. Guan , and H. Chen . Powerlyra: Differentiated graph computation and partitioning on skewed graphs . ACM Transactions on Parallel Computing , 5 ( 3 ), 13 , 2019 . R. Chen, J. Shi, Y. Chen, B. Zang, H. Guan, and H. Chen. Powerlyra: Differentiated graph computation and partitioning on skewed graphs. ACM Transactions on Parallel Computing, 5(3), 13, 2019.","journal-title":"ACM Transactions on Parallel Computing"},{"key":"e_1_3_2_1_3_1","article-title":"A parallel graph partitioning algorithm for a message-passing multiprocessor","volume":"498","author":"Gilbert J. R.","year":"1987","unstructured":"J. R. Gilbert and E. Zmijewski . A parallel graph partitioning algorithm for a message-passing multiprocessor . International Journal of Parallel Programming, (16) : 498-513 , 1987 . J. R. Gilbert and E. Zmijewski. A parallel graph partitioning algorithm for a message-passing multiprocessor. International Journal of Parallel Programming, (16):498-513, 1987.","journal-title":"International Journal of Parallel Programming, (16)"},{"key":"e_1_3_2_1_4_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementation","author":"Gonzalez J.E.","year":"2012","unstructured":"J.E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Powergraph: Distributed graph-parallel computation on natural graphs . In USENIX Symposium on Operating Systems Design and Implementation , 2012 . J.E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In USENIX Symposium on Operating Systems Design and Implementation, 2012."},{"key":"e_1_3_2_1_5_1","volume-title":"Gemini: A Computation-Centric Distributed Graph Processing System. In USENIX Symposium on Operating Systems Design and Implementation","author":"Zhu X.","year":"2016","unstructured":"X. Zhu , W. Chen , W. Zheng , and X. Ma . Gemini: A Computation-Centric Distributed Graph Processing System. In USENIX Symposium on Operating Systems Design and Implementation , 2016 . X. Zhu, W. Chen, W. Zheng, and X. Ma. Gemini: A Computation-Centric Distributed Graph Processing System. In USENIX Symposium on Operating Systems Design and Implementation, 2016."},{"key":"e_1_3_2_1_7_1","volume-title":"ACM\/IEEE Conference on Supercomputing","author":"Hendrickson B.","year":"1995","unstructured":"B. Hendrickson and R. Leland . A multilevel algorithm for partitioning graphs . In ACM\/IEEE Conference on Supercomputing , 1995 . B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In ACM\/IEEE Conference on Supercomputing, 1995."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_10_1","volume-title":"ACM\/IEEE Conference on Supercomputing","author":"Karypis G.","year":"1996","unstructured":"G. Karypis and V. Kumar . Parallel multilevel k-way partitioning scheme for irregular graphs . In ACM\/IEEE Conference on Supercomputing , 1996 . G. Karypis and V. Kumar. Parallel multilevel k-way partitioning scheme for irregular graphs. In ACM\/IEEE Conference on Supercomputing, 1996."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_1_12_1","first-page":"19","volume-title":"Workshop on Languages and Compilers for Parallel Computing","author":"Koduru S-C.","year":"2016","unstructured":"S-C. Koduru , R. Gupta , and I. Neamtiu . Size oblivious programming with InfiniMem . In Workshop on Languages and Compilers for Parallel Computing , pages 3\u2013 19 , 2016 . S-C. Koduru, R. Gupta, and I. Neamtiu. Size oblivious programming with InfiniMem. In Workshop on Languages and Compilers for Parallel Computing, pages 3\u201319, 2016."},{"key":"e_1_3_2_1_13_1","volume-title":"S-C. Koduru and R. Gupta. Out-of-Core MapReduce For Large Data Sets. In Proceedings of 2018 ACM SIGPLAN International Symposium on Memory Management, ACM, NY, USA","author":"Kaur G.","year":"2018","unstructured":"G. Kaur , K. Vora , S-C. Koduru and R. Gupta. Out-of-Core MapReduce For Large Data Sets. In Proceedings of 2018 ACM SIGPLAN International Symposium on Memory Management, ACM, NY, USA , 2018 . G. Kaur, K. Vora, S-C. Koduru and R. Gupta. Out-of-Core MapReduce For Large Data Sets. In Proceedings of 2018 ACM SIGPLAN International Symposium on Memory Management, ACM, NY, USA, 2018."},{"key":"e_1_3_2_1_14_1","volume-title":"GO: Out-of-Core Partitioning of Large Irregular Graphs. In 15th IEEE International Conference on Networking, Architecture and Storage, IEEE NAS","author":"Kaur G.","year":"2021","unstructured":"G. Kaur and R. Gupta . GO: Out-of-Core Partitioning of Large Irregular Graphs. In 15th IEEE International Conference on Networking, Architecture and Storage, IEEE NAS 2021 . G. Kaur and R. Gupta. GO: Out-of-Core Partitioning of Large Irregular Graphs. In 15th IEEE International Conference on Networking, Architecture and Storage, IEEE NAS 2021."},{"key":"e_1_3_2_1_15_1","first-page":"46","volume-title":"USENIX Symposium on Operating Systems Design and Implementation","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . Graphchi: Large-scale graph computation on just a pc . In USENIX Symposium on Operating Systems Design and Implementation , pages 31\u2013 46 , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. In USENIX Symposium on Operating Systems Design and Implementation, pages 31\u201346, 2012."},{"key":"e_1_3_2_1_16_1","volume-title":"Stanford large network dataset collection","author":"Leskovec J.","year":"2011","unstructured":"J. Leskovec . \u201c Stanford large network dataset collection ,\u201d http:\/\/snap.stanford.edu\/data\/index.html, 2011 . J. Leskovec. \u201cStanford large network dataset collection,\u201d http:\/\/snap.stanford.edu\/data\/index.html, 2011."},{"key":"e_1_3_2_1_17_1","volume-title":"Multithreaded Graph Partitioning. In IEEE International Parallel and Distributed Processing Symposium","author":"LaSalle D.","year":"2013","unstructured":"D. LaSalle , and G. Karypis . Multithreaded Graph Partitioning. In IEEE International Parallel and Distributed Processing Symposium , 2013 . D. LaSalle, and G. Karypis. Multithreaded Graph Partitioning. In IEEE International Parallel and Distributed Processing Symposium, 2013."},{"key":"e_1_3_2_1_18_1","volume-title":"Improving Graph Partitioning for Modern Graphs and Architectures. In Workshop on Irregular Applications: Architectures and Algorithms","author":"LaSalle D.","year":"2015","unstructured":"D. LaSalle , Md M. A. Patwary , N. Satish , N. Sundaram , G. Karypis and P. Dubey . Improving Graph Partitioning for Modern Graphs and Architectures. In Workshop on Irregular Applications: Architectures and Algorithms , 2015 . D. LaSalle, Md M. A. Patwary, N. Satish, N. Sundaram, G. Karypis and P. Dubey. Improving Graph Partitioning for Modern Graphs and Architectures. In Workshop on Irregular Applications: Architectures and Algorithms, 2015."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_20_1","first-page":"135","volume-title":"SIGMOD International Conf. on Management of Data","author":"Malewicz G.","year":"2010","unstructured":"G. Malewicz , M.H. Austern , A.J.C Bik , J.C. Dehnert , I. Horn , N. Leiser , and G. Czajkowski . Pregel: a system for large-scale graph processing . In SIGMOD International Conf. on Management of Data , pages 135 - 146 , 2010 . G. Malewicz, M.H. Austern, A.J.C Bik, J.C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD International Conf. on Management of Data, pages 135-146, 2010."},{"key":"e_1_3_2_1_21_1","volume-title":"SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles","author":"Mihailovic Amitabha","year":"2013","unstructured":"Roy, Amitabha and Mihailovic , Ivo and Zwaenepoel , Willy. X-Stream : Edge-centric graph processing using streaming partitions . In SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles , 2013 . Roy, Amitabha and Mihailovic, Ivo and Zwaenepoel, Willy. X-Stream: Edge-centric graph processing using streaming partitions. In SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles, 2013."},{"key":"e_1_3_2_1_22_1","first-page":"456","volume-title":"ACM Symposium on Operating Systems Principles","author":"Nguyen D.","year":"2013","unstructured":"D. Nguyen , A. Lenharth , and K. Pingali . A Lightweight Infrastructure for Graph Analytics . In ACM Symposium on Operating Systems Principles , pages 456 - 471 , 2013 . D. Nguyen, A. Lenharth, and K. Pingali. A Lightweight Infrastructure for Graph Analytics. In ACM Symposium on Operating Systems Principles, pages 456-471, 2013."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-61142-8_588","volume-title":"International Conference and Exhibition on High-Performance Computing and Networking","author":"Pellegrini F.","year":"1996","unstructured":"F. Pellegrini and J. Roman . Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs . In International Conference and Exhibition on High-Performance Computing and Networking , pages 493 - 498 , 1996 . F. Pellegrini and J. Roman. Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In International Conference and Exhibition on High-Performance Computing and Networking, pages 493-498, 1996."},{"key":"e_1_3_2_1_24_1","volume-title":"Distributed evolutionary graph partitioning. CoRR","author":"Sanders P.","year":"2011","unstructured":"P. Sanders and C. Schulz . Distributed evolutionary graph partitioning. CoRR , vol. abs\/ 1110 .0477, 2011 . P. Sanders and C. Schulz. Distributed evolutionary graph partitioning. CoRR, vol. abs\/1110.0477, 2011."},{"key":"e_1_3_2_1_25_1","first-page":"135","volume-title":"ACM Symposium on Principles and Practice of Parallel Programming","author":"Shun J.","year":"2013","unstructured":"J. Shun and G. Blelloch . Ligra: a lightweight graph processing framework for shared memory . In ACM Symposium on Principles and Practice of Parallel Programming , pages 135 - 146 , 2013 . J. Shun and G. Blelloch. Ligra: a lightweight graph processing framework for shared memory. In ACM Symposium on Principles and Practice of Parallel Programming, pages 135-146, 2013."},{"key":"e_1_3_2_1_26_1","first-page":"429","volume-title":"LUMOS: Dependency-Driven Disk-based Graph Processing. In USENIX Annual Technical Conference","author":"Vora K.","year":"2019","unstructured":"K. Vora . LUMOS: Dependency-Driven Disk-based Graph Processing. In USENIX Annual Technical Conference , pages 429 - 442 , 2019 . K. Vora. LUMOS: Dependency-Driven Disk-based Graph Processing. In USENIX Annual Technical Conference, pages 429-442, 2019."},{"key":"e_1_3_2_1_27_1","first-page":"522","volume-title":"USENIX Annual Technical Conference","author":"Vora K.","year":"2016","unstructured":"K. Vora , G. Xu , and R. Gupta . Load the edges you need: A generic i\/o optimization for disk-based graph processing . In USENIX Annual Technical Conference , pages 507\u2013 522 , 2016 . K. Vora, G. Xu, and R. Gupta. Load the edges you need: A generic i\/o optimization for disk-based graph processing. In USENIX Annual Technical Conference, pages 507\u2013522, 2016."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00046-6"},{"key":"e_1_3_2_1_29_1","first-page":"386","volume-title":"USENIX Annual Technical Conference","author":"Zhu X.","year":"2015","unstructured":"X. Zhu , W. Han , and W. Chen . GridGraph: Large-Scale Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning . In USENIX Annual Technical Conference , pages 375\u2013 386 , 2015 . X. Zhu, W. Han, and W. Chen. GridGraph: Large-Scale Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning. In USENIX Annual Technical Conference, pages 375\u2013386, 2015."},{"key":"e_1_3_2_1_30_1","unstructured":"Konect: http:\/\/konect.cc\/networks\/ \t\t\t\t  Konect: http:\/\/konect.cc\/networks\/"},{"key":"e_1_3_2_1_31_1","unstructured":"Protocol Buffers. Google\u2019s data interchange format https:\/\/developers.google.com\/protocol-buffers \t\t\t\t  Protocol Buffers. Google\u2019s data interchange format https:\/\/developers.google.com\/protocol-buffers"}],"event":{"name":"ISMM '23: 2023 ACM SIGPLAN International Symposium on Memory Management","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Orlando FL USA","acronym":"ISMM '23"},"container-title":["Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3591195.3595268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3591195.3595268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:31Z","timestamp":1750178251000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3591195.3595268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,6]]},"references-count":30,"alternative-id":["10.1145\/3591195.3595268","10.1145\/3591195"],"URL":"https:\/\/doi.org\/10.1145\/3591195.3595268","relation":{},"subject":[],"published":{"date-parts":[[2023,6,6]]},"assertion":[{"value":"2023-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}