{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:26:43Z","timestamp":1769045203339,"version":"3.49.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:00:00Z","timestamp":1726272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDB44000000"],"award-info":[{"award-number":["XDB44000000"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>With the explosive growth of graph data, distributed graph processing has become popular, and many graph hardware accelerators use distributed frameworks. Graph partitioning is foundation in distributed graph processing. However, dynamic changes in graph make existing partitioning shifted from its optimized points and cause system performance degraded. Therefore, more efficient dynamic graph partition methods are needed.<\/jats:p>\n          <jats:p>In this work, we propose GraphSER, a dynamic graph partition method for many-core systems. To improve the cross-node spatial locality and reduce the overhead of repartition, we propose a stream-based edge repartition, in which each computing node sequentially traverses its local edge list in parallel, then migrating edges based on distance and replica degree. GraphSER does not need costly searching and prioritizes nodes so it can avoid poor cross-node spatial locality.<\/jats:p>\n          <jats:p>Our evaluation shows that compared to state-of-the-art edge repartition software methods, GraphSER has an average speedup of 1.52\u00d7, with the maximum up to 2\u00d7. Compared to the previous many-core hardware repartition method, GraphSER performance has an average of 40% improvement, with the maximum to 117%.<\/jats:p>","DOI":"10.1145\/3661998","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T11:25:41Z","timestamp":1714130741000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["GraphSER: Distance-Aware Stream-Based Edge Repartition for Many-Core Systems"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0963-0404","authenticated-orcid":false,"given":"Junkaixuan","family":"Li","sequence":"first","affiliation":[{"name":"School of Microelectronics, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5487-6855","authenticated-orcid":false,"given":"Yi","family":"Kang","sequence":"additional","affiliation":[{"name":"School of Microelectronics, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,14]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_3_1_3_2","first-page":"120","volume-title":"Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"Andreev Konstantin","year":"2004","unstructured":"Konstantin Andreev and Harald R\u00e4cke. 2004. Balanced graph partitioning. In Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures. 120\u2013124."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3219422"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_1_6_2","article-title":"Practice of streaming processing of dynamic graphs: Concepts, models, and systems","author":"Besta Maciej","year":"2021","unstructured":"Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov, and Torsten Hoefler. 2021. Practice of streaming processing of dynamic graphs: Concepts, models, and systems. IEEE Trans. Parallel Distrib. Syst. 34, 6 (2021), 1860\u20131876.","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623660"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508403"},{"key":"e_1_3_1_9_2","volume-title":"Proceedings of the 4th International AAAI Conference on Weblogs and Social Media (ICWSM)","author":"Cha Meeyoung","unstructured":"Meeyoung Cha, Hamed Haddadi, Fabricio Benevenuto, and Krishna P. Gummadi. 2010. Measuring user influence in Twitter: The million follower fallacy. In Proceedings of the 4th International AAAI Conference on Weblogs and Social Media (ICWSM)."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526806"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168846"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2821565"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01660031"},{"key":"e_1_3_1_15_2","first-page":"1","volume-title":"Proceedings of the IEEE Conference on High Performance Extreme Computing","author":"Ediger David","year":"2012","unstructured":"David Ediger, Rob McColl, Jason Riedy, and David A. Bader. 2012. Stinger: High performance data structure for streaming graphs. In Proceedings of the IEEE Conference on High Performance Extreme Computing. IEEE, 1\u20135."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035944"},{"key":"e_1_3_1_18_2","first-page":"1814","volume-title":"Proceedings of the IEEE International Conference on Big Data (Big Data\u201915)","author":"Feng Guoyao","year":"2015","unstructured":"Guoyao Feng, Xiao Meng, and Khaled Ammar. 2015. DISTINGER: A distributed graph data structure for massive dynamic graph processing. In Proceedings of the IEEE International Conference on Big Data (Big Data\u201915). IEEE, 1814\u20131822."},{"key":"e_1_3_1_19_2","first-page":"6","volume-title":"Proceedings of the IEEE International Electron Devices Meeting (IEDM\u201920)","author":"Fujun Bai","year":"2020","unstructured":"Bai Fujun, Jiang Xiping, Wang Song, Yu Bing, Tan Jie, Zuo Fengguo, Wang Chunjuan, Wang Fan, Long Xiaodong, Yu Guoqing, Fu Ni, Li Qiannan, Li Hua, Wang Kexin, Duan Huifu, Bai Liang, Jia Xuerong, Li Jin, Li Mei, Wang Zhengwen, Hu Sheng, Zhou Jun, Zhan Qiong, Sun Peng, Yang Daohong, Cheichan Kau, David Yang, Ching-Sung Ho, Sun Hongbin, Lv Hangbing, Liu Ming, Kang Yi, and Ren Qiwei. 2020. A stacked embedded DRAM array for LPDDR4\/4X using hybrid bonding 3D integration with 34GB\/s\/1Gb 0.88 pJ\/b logic-to-memory interface. In Proceedings of the IEEE International Electron Devices Meeting (IEDM\u201920). IEEE, 6\u20136."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461550"},{"key":"e_1_3_1_21_2","first-page":"17","volume-title":"Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201912)","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201912). 17\u201330."},{"key":"e_1_3_1_22_2","first-page":"1","volume-title":"Proceedings of the IEEE High Performance Extreme Computing Conference (HPEC\u201916)","author":"Green Oded","year":"2016","unstructured":"Oded Green and David A. Bader. 2016. cuSTINGER: Supporting dynamic graph algorithms for GPUs. In Proceedings of the IEEE High Performance Extreme Computing Conference (HPEC\u201916). IEEE, 1\u20136."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157799"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2013.6557149"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/LSSC.2022.3171862"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1403"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2015.2414456"},{"key":"e_1_3_1_30_2","first-page":"439","volume-title":"Proceedings of the IEEE 10Th International Conference On Cloud Computing (CLOUD\u201917)","author":"Kumar Dinesh","year":"2017","unstructured":"Dinesh Kumar, Arun Raj, and Janakiram Dharanipragada. 2017. GraphSteal: Dynamic re-partitioning for efficient graph processing in heterogeneous clusters. In Proceedings of the IEEE 10Th International Conference On Cloud Computing (CLOUD\u201917). IEEE, 439\u2013446."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3069292"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3090373"},{"key":"e_1_3_1_36_2","article-title":"Distributed GraphLab: A framework for machine learning in the cloud","author":"Low Yucheng","year":"2012","unstructured":"Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. 2012. Distributed GraphLab: A framework for machine learning in the cloud. arXiv preprint arXiv:1204.6078 (2012).","journal-title":"arXiv preprint arXiv:1204.6078"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_1_38_2","first-page":"1","volume-title":"Proceedings of the 14th EuroSys Conference","author":"Mariappan Mugilan","year":"2019","unstructured":"Mugilan Mariappan and Keval Vora. 2019. GraphBolt: Dependency-driven synchronous processing of streaming graphs. In Proceedings of the 14th EuroSys Conference. 1\u201316."},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2794989"},{"key":"e_1_3_1_40_2","first-page":"1","volume-title":"Proceedings of the 56th Annual Design Automation Conference","author":"McCrabb Andrew","year":"2019","unstructured":"Andrew McCrabb, Eric Winsor, and Valeria Bertacco. 2019. DREDGE: Dynamic repartitioning during dynamic graph execution. In Proceedings of the 56th Annual Design Automation Conference. 1\u20136."},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_1_42_2","first-page":"45","article-title":"Introducing the Graph 500","volume":"19","author":"Murphy Richard C.","year":"2010","unstructured":"Richard C. Murphy, Kyle B. Wheeler, Brian W. Barrett, and James A. Ang. 2010. Introducing the Graph 500. Cray Users Group 19 (2010), 45\u201374.","journal-title":"Cray Users Group"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806424"},{"key":"e_1_3_1_44_2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-662-43352-2_15","volume-title":"Distributed Applications and Interoperable Systems: 14th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (DAIS\u201914), Held as Part of the 9th International Federated Conference on Distributed Computing Techniques (DisCoTec \u201914)","author":"Rahimian Fatemeh","year":"2014","unstructured":"Fatemeh Rahimian, Amir H. Payberah, Sarunas Girdzijauskas, and Seif Haridi. 2014. Distributed vertex-cut partitioning. In Distributed Applications and Interoperable Systems: 14th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (DAIS\u201914), Held as Part of the 9th International Federated Conference on Distributed Computing Techniques (DisCoTec \u201914). Springer, 186\u2013200."},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480126"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3434642"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/2508148.2485963"},{"key":"e_1_3_1_49_2","first-page":"319","volume-title":"Proceedings of the 22nd International Conference on Parallel and Distributed Computing: Parallel Processing (Euro-Par\u201916)","author":"Sengupta Dipanjan","year":"2016","unstructured":"Dipanjan Sengupta, Narayanan Sundaram, Xia Zhu, Theodore L. Willke, Jeffrey Young, Matthew Wolf, and Karsten Schwan. 2016. GraphIn: An online high performance incremental graph processing framework. In Proceedings of the 22nd International Conference on Parallel and Distributed Computing: Parallel Processing (Euro-Par\u201916). Springer, 319\u2013333."},{"key":"e_1_3_1_50_2","first-page":"1","volume-title":"Proceedings of the 56th Annual Design Automation Conference 2019","author":"Singh Gagandeep","year":"2019","unstructured":"Gagandeep Singh, Juan G\u00f3mez-Luna, Giovanni Mariani, Geraldo F. Oliveira, Stefano Corda, Sander Stuijk, Onur Mutlu, and Henk Corporaal. 2019. NAPEL: Near-memory computing application performance prediction via ensemble learning. In Proceedings of the 56th Annual Design Automation Conference 2019. 1\u20136."},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00053"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661998","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3661998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:22Z","timestamp":1750291582000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,14]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3661998"],"URL":"https:\/\/doi.org\/10.1145\/3661998","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,14]]},"assertion":[{"value":"2023-10-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}