{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:43:41Z","timestamp":1783439021567,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC","award":["62172382"],"award-info":[{"award-number":["62172382"]}]},{"name":"National Key R&D Program of China","award":["2018YFB1800203"],"award-info":[{"award-number":["2018YFB1800203"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,29]]},"DOI":"10.1145\/3545008.3545060","type":"proceedings-article","created":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T01:04:08Z","timestamp":1673744648000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards Fast Large-scale Graph Analysis via Two-dimensional Balanced Partitioning"],"prefix":"10.1145","author":[{"given":"Shuai","family":"Lin","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongkun","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[{"name":"Anhui Province Key Laboratory of High Performance Computing, University of Science and Technology of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Chen","sequence":"additional","affiliation":[{"name":"Huawei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pengcheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Huawei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Han","sequence":"additional","affiliation":[{"name":"Huawei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236208"},{"key":"e_1_3_2_1_2_1","volume-title":"USENIX Annul Technical Conference.","author":"Ai Zhiyuan","year":"2017","unstructured":"Zhiyuan Ai, Mingxing Zhang, Yongwei Wu, Xuehai Qian, Kang Chen, and Weimin Zheng. 2017. Squeezing out all the value of loaded data: An out-of-core graph processing system with reduced disk i\/o. In USENIX Annul Technical Conference."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3001645"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324307"},{"key":"e_1_3_2_1_5_1","first-page":"5","article-title":"Giraph: Large-scale graph processing infrastructure on hadoop. Proceedings of the Hadoop Summit","volume":"11","author":"Avery Ching","year":"2011","unstructured":"Ching Avery. 2011. Giraph: Large-scale graph processing infrastructure on hadoop. Proceedings of the Hadoop Summit. Santa Clara 11, 3 (2011), 5\u20139.","journal-title":"Santa Clara"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623660"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298989"},{"key":"e_1_3_2_1_9_1","volume-title":"PT-Scotch: A tool for efficient parallel graph ordering. Parallel computing 34, 6-8","author":"Chevalier C\u00e9dric","year":"2008","unstructured":"C\u00e9dric Chevalier and Fran\u00e7ois Pellegrini. 2008. PT-Scotch: A tool for efficient parallel graph ordering. Parallel computing 34, 6-8 (2008), 318\u2013331."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"William\u00a0E Donath and Alan\u00a0J Hoffman. 2003. Lower bounds for the partitioning of graphs. In Selected Papers Of Alan J Hoffman: With Commentary. World Scientific 437\u2013442.","DOI":"10.1142\/9789812796936_0044"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476369"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3097998"},{"key":"e_1_3_2_1_13_1","volume-title":"19th design automation conference","author":"Fiduccia M","unstructured":"Charles\u00a0M Fiduccia and Robert\u00a0M Mattheyses. 1982. A linear-time heuristic for improving network partitions. In 19th design automation conference. IEEE, 175\u2013181."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129104"},{"key":"e_1_3_2_1_15_1","unstructured":"Friendster. 2013. .http:\/\/konect.cc\/networks\/friendster\/"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00209"},{"key":"e_1_3_2_1_17_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementations.","author":"Gonzalez E","year":"2012","unstructured":"Joseph\u00a0E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. Powergraph: Distributed graph-parallel computation on natural graphs. In USENIX Symposium on Operating Systems Design and Implementations."},{"key":"e_1_3_2_1_18_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementations.","author":"Gonzalez E","year":"2014","unstructured":"Joseph\u00a0E Gonzalez, Reynold\u00a0S Xin, Ankur Dave, Daniel Crankshaw, Michael\u00a0J Franklin, and Ion Stoica. 2014. Graphx: Graph processing in a distributed dataflow framework. In USENIX Symposium on Operating Systems Design and Implementations."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In ACM Knowledge Discovery and Data Mining.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3358701.3358706"},{"key":"e_1_3_2_1_21_1","volume-title":"Fast connected-component labeling. Pattern recognition 42, 9","author":"He Lifeng","year":"2009","unstructured":"Lifeng He, Yuyan Chao, Kenji Suzuki, and Kesheng Wu. 2009. Fast connected-component labeling. Pattern recognition 42, 9 (2009), 1977\u20131987."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"e_1_3_2_1_23_1","volume-title":"ACM International Conference on Information and Knowledge Management. 437\u2013446","author":"Hussein Rana","year":"2018","unstructured":"Rana Hussein, Dingqi Yang, and Philippe Cudr\u00e9-Mauroux. 2018. Are meta-paths necessary? Revisiting heterogeneous graph embeddings. In ACM International Conference on Information and Knowledge Management. 437\u2013446."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629601"},{"key":"e_1_3_2_1_25_1","volume-title":"A quantitative measure of fairness and discrimination. Eastern Research Laboratory","author":"Jain K","year":"1984","unstructured":"Rajendra\u00a0K Jain, Dah-Ming\u00a0W Chiu, William\u00a0R Hawe, 1984. A quantitative measure of fairness and discrimination. Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA (1984)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2002. Simrank: a measure of structural-context similarity. In ACM Knowledge Discovery and Data Mining.","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_27_1","volume-title":"METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices.","author":"Karypis George","year":"1997","unstructured":"George Karypis and Vipin Kumar. 1997. METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. (1997)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598334138"},{"key":"e_1_3_2_1_29_1","volume-title":"An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49, 2","author":"Kernighan W","year":"1970","unstructured":"Brian\u00a0W Kernighan and Shen Lin. 1970. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49, 2 (1970), 291\u2013307."},{"key":"e_1_3_2_1_30_1","volume-title":"USENIX Annul Technical Conference.","author":"Khan Arijit","year":"2018","unstructured":"Arijit Khan, Gustavo Segovia, and Donald Kossmann. 2018. On smart query routing: for distributed graph querying with decoupled storage. In USENIX Annul Technical Conference."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507173"},{"key":"e_1_3_2_1_32_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementations.","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012. Graphchi: Large-scale graph computation on just a PC. In USENIX Symposium on Operating Systems Design and Implementations."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/75104.75105"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816696"},{"key":"e_1_3_2_1_35_1","volume-title":"Conference on File and Storage Technologies.","author":"Liu Hang","year":"2017","unstructured":"Hang Liu and H\u00a0Howie Huang. 2017. Graphene: Fine-grained {IO} management for graph computing. In Conference on File and Storage Technologies."},{"key":"e_1_3_2_1_36_1","unstructured":"LiveJournal. 2006. .http:\/\/konect.cc\/networks\/livejournal-groupmemberships\/"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.153"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806424"},{"key":"e_1_3_2_1_42_1","volume-title":"Modeling interactome: scale-free or geometric?Bioinformatics 20, 18","author":"Pr\u017eulj Natasa","year":"2004","unstructured":"Natasa Pr\u017eulj, Derek\u00a0G Corneil, and Igor Jurisica. 2004. Modeling interactome: scale-free or geometric?Bioinformatics 20, 18 (2004), 3508\u20133515."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900704"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483585"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Isabelle Stanton and Gabriel Kliot. 2012. Streaming graph partitioning for large distributed graphs. In ACM Knowledge Discovery and Data Mining.","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_3_2_1_51_1","unstructured":"Twitter. 2010. .https:\/\/law.di.unimi.it\/webdata\/twitter-2010\/"},{"key":"e_1_3_2_1_52_1","volume-title":"USENIX Annul Technical Conference.","author":"Vora Keval","year":"2016","unstructured":"Keval Vora, Guoqing Xu, and Rajiv Gupta. 2016. Load the edges you need: A generic I\/O optimization for disk-based graph processing. In USENIX Annul Technical Conference."},{"key":"e_1_3_2_1_53_1","volume-title":"JOSTLE: parallel multilevel graph-partitioning software\u2013an overview. Mesh partitioning techniques and domain decomposition techniques 10","author":"Walshaw Chris","year":"2007","unstructured":"Chris Walshaw and Mark Cross. 2007. JOSTLE: parallel multilevel graph-partitioning software\u2013an overview. Mesh partitioning techniques and domain decomposition techniques 10 (2007), 27\u201358."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816682"},{"key":"e_1_3_2_1_55_1","volume-title":"USENIX Annul Technical Conference.","author":"Wang Rui","year":"2020","unstructured":"Rui Wang, Yongkun Li, Hong Xie, Yinlong Xu, and John\u00a0CS Lui. 2020. Graphwalker: An i\/o-efficient and resource-friendly graph analytic system for fast and scalable random walks. In USENIX Annul Technical Conference."},{"key":"e_1_3_2_1_56_1","volume-title":"Annual Conference on Neural Information Processing Systems, Vol.\u00a027","author":"Xie Cong","year":"2014","unstructured":"Cong Xie, Ling Yan, Wu-Jun Li, and Zhihua Zhang. 2014. Distributed Power-law Graph Computing: Theoretical and Empirical Analysis.. In Annual Conference on Neural Information Processing Systems, Vol.\u00a027. 1673\u20131681."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359634"},{"key":"e_1_3_2_1_58_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementations.","author":"Zhu Xiaowei","year":"2016","unstructured":"Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A computation-centric distributed graph processing system. In USENIX Symposium on Operating Systems Design and Implementations."},{"key":"e_1_3_2_1_59_1","volume-title":"Livegraph: A transactional graph storage system with purely sequential adjacency list scans. arXiv preprint arXiv:1910.05773(2019).","author":"Zhu Xiaowei","year":"2019","unstructured":"Xiaowei Zhu, Guanyu Feng, Marco Serafini, Xiaosong Ma, Jiping Yu, Lei Xie, Ashraf Aboulnaga, and Wenguang Chen. 2019. Livegraph: A transactional graph storage system with purely sequential adjacency list scans. arXiv preprint arXiv:1910.05773(2019)."},{"key":"e_1_3_2_1_60_1","volume-title":"USENIX Annul Technical Conference.","author":"Zhu Xiaowei","year":"2015","unstructured":"Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015. Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In USENIX Annul Technical Conference."}],"event":{"name":"ICPP '22: 51st International Conference on Parallel Processing","location":"Bordeaux France","acronym":"ICPP '22"},"container-title":["Proceedings of the 51st International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545060","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545008.3545060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:44Z","timestamp":1750186964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":59,"alternative-id":["10.1145\/3545008.3545060","10.1145\/3545008"],"URL":"https:\/\/doi.org\/10.1145\/3545008.3545060","relation":{},"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2023-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}