{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:10Z","timestamp":1750220590352,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T00:00:00Z","timestamp":1597622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National key research and development program of China","award":["2018YFA0701804,2018YFA0701805"],"award-info":[{"award-number":["2018YFA0701804,2018YFA0701805"]}]},{"name":"Creative Research Group Project of NSFC","award":["61821003,61872156"],"award-info":[{"award-number":["61821003,61872156"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,17]]},"DOI":"10.1145\/3404397.3404453","type":"proceedings-article","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T03:54:26Z","timestamp":1596945266000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["GraBi: Communication-Efficient and Workload-Balanced Partitioning for Bipartite Graphs"],"prefix":"10.1145","author":[{"given":"Feng","family":"Sheng","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Cao","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Jiang","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington Department of Computer Science and Engineering, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Yao","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Konect Network Dataset. http:\/\/konect.uni-koblenz.de\/.  [n.d.]. Konect Network Dataset. http:\/\/konect.uni-koblenz.de\/."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. Wikimedia Downloads. https:\/\/dumps.wikimedia.org\/.  [n.d.]. Wikimedia Downloads. https:\/\/dumps.wikimedia.org\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti Yiping Zhan and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. In SDM.  Deepayan Chakrabarti Yiping Zhan and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. In SDM.","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Rong Chen Jiaxin Shi Yanzhe Chen and Haibo Chen. 2015. PowerLyra: differentiated graph computation and partitioning on skewed graphs. In Eurosys.  Rong Chen Jiaxin Shi Yanzhe Chen and Haibo Chen. 2015. PowerLyra: differentiated graph computation and partitioning on skewed graphs. In Eurosys.","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Rong Chen Jiaxin Shi Binyu Zang and Haibing Guan. 2014. Bipartite-oriented distributed graph partitioning for big learning. In APSys.  Rong Chen Jiaxin Shi Binyu Zang and Haibing Guan. 2014. Bipartite-oriented distributed graph partitioning for big learning. In APSys.","DOI":"10.1145\/2637166.2637236"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078606"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Inderjit\u00a0S. Dhillon. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In SIGKDD.  Inderjit\u00a0S. Dhillon. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In SIGKDD.","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Bin Gao Tie-Yan Liu Xin Zheng QianSheng Cheng and Wei-Ying Ma. 2005. Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In SIGKDD.  Bin Gao Tie-Yan Liu Xin Zheng QianSheng Cheng and Wei-Ying Ma. 2005. Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In SIGKDD.","DOI":"10.1145\/1081870.1081879"},{"key":"e_1_3_2_1_9_1","unstructured":"Joseph\u00a0E. Gonzalez Yucheng Low Haijie Gu Danny Bickson and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI.  Joseph\u00a0E. Gonzalez Yucheng Low Haijie Gu Danny Bickson and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI."},{"key":"e_1_3_2_1_10_1","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 OSDI.  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 OSDI."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/305219.305248"},{"key":"e_1_3_2_1_12_1","unstructured":"Daniel\u00a0D. Lee and H.\u00a0Sebastian Seung. 2000. Algorithms for Non-negative Matrix Factorization. In NIPS.  Daniel\u00a0D. Lee and H.\u00a0Sebastian Seung. 2000. Algorithms for Non-negative Matrix Factorization. In NIPS."},{"key":"e_1_3_2_1_13_1","unstructured":"Dongsheng Li Chengfei Zhang Jinyan Wang Zhaoning Zhang and Yiming Zhang. 2017. GraphA: Adaptive Partitioning for Natural Graphs. In ICDCS.  Dongsheng Li Chengfei Zhang Jinyan Wang Zhaoning Zhang and Yiming Zhang. 2017. GraphA: Adaptive Partitioning for Natural Graphs. In ICDCS."},{"volume-title":"Graphene: Fine-Grained IO Management for Graph Computing. In FAST.","year":"2017","author":"Liu Hang","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Grzegorz Malewicz Matthew\u00a0H. Austern Aart J.\u00a0C. Bik James\u00a0C. Dehnert Ilan Horn Naty Leiser and Grzegorz Czajkowski. 2010. Pregel: a system for large-scale graph processing. In SIGMOD.  Grzegorz Malewicz Matthew\u00a0H. Austern Aart J.\u00a0C. Bik James\u00a0C. Dehnert Ilan Horn Naty Leiser and Grzegorz Czajkowski. 2010. Pregel: a system for large-scale graph processing. In SIGMOD.","DOI":"10.1145\/1807167.1807184"},{"volume-title":"ADWISE: Adaptive Window-Based Streaming Edge Partitioning for High-Speed Graph Processing. In ICDCS.","year":"2018","author":"Mayer Christian","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007267"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920931"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577091"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Jie Yan Guangming Tan and Ninghui Sun. 2015. Study on Partitioning Real-World Directed Graphs of Skewed Degree Distribution. In ICPP.  Jie Yan Guangming Tan and Ninghui Sun. 2015. Study on Partitioning Real-World Directed Graphs of Skewed Degree Distribution. In ICPP.","DOI":"10.1109\/ICPP.2015.37"},{"key":"e_1_3_2_1_23_1","unstructured":"Mingxing Zhang Yongwei Wu Kang Chen Xuehai Qian Xue Li and Weimin Zheng. 2016. Exploring the Hidden Dimension in Graph Processing. In OSDI.  Mingxing Zhang Yongwei Wu Kang Chen Xuehai Qian Xue Li and Weimin Zheng. 2016. Exploring the Hidden Dimension in Graph Processing. In OSDI."},{"key":"e_1_3_2_1_24_1","unstructured":"Yunhong Zhou Dennis\u00a0M. Wilkinson Robert Schreiber and Rong Pan. 2008. Large-Scale Parallel Collaborative Filtering for the Netflix Prize. In AAIM.  Yunhong Zhou Dennis\u00a0M. Wilkinson Robert Schreiber and Rong Pan. 2008. Large-Scale Parallel Collaborative Filtering for the Netflix Prize. In AAIM."},{"key":"e_1_3_2_1_25_1","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 ATC.  Xiaowei Zhu Wentao Han and Wenguang Chen. 2015. GridGraph: Large-Scale Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning. In USENIX ATC."}],"event":{"name":"ICPP '20: 49th International Conference on Parallel Processing","acronym":"ICPP '20","location":"Edmonton AB Canada"},"container-title":["49th International Conference on Parallel Processing - ICPP"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404397.3404453","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3404397.3404453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:43Z","timestamp":1750195903000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404397.3404453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,17]]},"references-count":25,"alternative-id":["10.1145\/3404397.3404453","10.1145\/3404397"],"URL":"https:\/\/doi.org\/10.1145\/3404397.3404453","relation":{},"subject":[],"published":{"date-parts":[[2020,8,17]]},"assertion":[{"value":"2020-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}