{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:48Z","timestamp":1750220448942,"version":"3.41.0"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","issue":"1-4","license":[{"start":{"date-parts":[[2019,11,30]],"date-time":"2019-11-30T00:00:00Z","timestamp":1575072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1750656,CCF-1919289"],"award-info":[{"award-number":["CCF-1750656,CCF-1919289"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Syst."],"published-print":{"date-parts":[[2019,11,30]]},"abstract":"<jats:p>\n            To hide the complexity of the underlying system, graph processing frameworks ask programmers to specify graph computations in user-defined functions (UDFs) of graph-oriented programming model. Due to the nature of distributed execution, current frameworks cannot precisely enforce the semantics of UDFs, leading to unnecessary computation and communication. It exemplifies a gap between programming model and runtime execution. This article proposes novel graph processing frameworks for distributed system and Processing-in-memory (PIM) architecture that precisely enforces loop-carried dependency; i.e., when a condition is satisfied by a neighbor, all following neighbors can be skipped. Our approach instruments the UDFs to express the loop-carried dependency, then the distributed execution framework enforces the precise semantics by performing dependency propagation dynamically. Enforcing loop-carried dependency requires the sequential processing of the neighbors of each vertex distributed in different nodes. We propose to circulant scheduling in the framework to allow different nodes to process disjoint sets of edges\/vertices in parallel while satisfying the sequential requirement. The technique achieves an excellent trade-off between precise semantics and parallelism\u2014the benefits of eliminating unnecessary computation and communication offset the reduced parallelism. We implement a new distributed graph processing framework SympleGraph, and two variants of runtime systems\u2014\n            <jats:sc>GraphS<\/jats:sc>\n            and\n            <jats:sc>GraphSR<\/jats:sc>\n            \u2014for PIM-based graph processing architecture, which significantly outperform the state-of-the-art.\n          <\/jats:p>","DOI":"10.1145\/3453681","type":"journal-article","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:15:20Z","timestamp":1625134520000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Graph Processing System and Processing-in-memory Architecture with Precise Loop-carried Dependency Guarantee"],"prefix":"10.1145","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1557-2613","authenticated-orcid":false,"given":"Youwei","family":"Zhuo","sequence":"first","affiliation":[{"name":"University of Southern California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingji","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Southern California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gengyu","family":"Rao","sequence":"additional","affiliation":[{"name":"University of Southern California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinyi","family":"Luo","sequence":"additional","affiliation":[{"name":"University of Southern California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanzhi","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hailong","family":"Yang","sequence":"additional","affiliation":[{"name":"Beihang University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Depei","family":"Qian","sequence":"additional","affiliation":[{"name":"Beihang University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuehai","family":"Qian","sequence":"additional","affiliation":[{"name":"University of Southern California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbl022"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL\u201907)","author":"Alexandrescu Andrei","year":"2007","unstructured":"Andrei Alexandrescu and Katrin Kirchhoff . 2007 . Data-driven graph construction for semi-supervised graph-based learning in NLP . In Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL\u201907) . 204\u2013211. Andrei Alexandrescu and Katrin Kirchhoff. 2007. Data-driven graph construction for semi-supervised graph-based learning in NLP. In Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL\u201907). 204\u2013211."},{"key":"e_1_2_1_4_1","unstructured":"ARM. 2009. ARM Cortex-A5 Processor. Retrieved from http:\/\/www.arm.com\/products\/processors\/cortex-a\/cortex-a5.php.  ARM. 2009. ARM Cortex-A5 Processor. Retrieved from http:\/\/www.arm.com\/products\/processors\/cortex-a\/cortex-a5.php."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2019.00051"},{"key":"e_1_2_1_6_1","volume-title":"Ryan Faulkner et\u00a0al","author":"Battaglia Peter W","year":"2018","unstructured":"Peter W Battaglia , Jessica B Hamrick , Victor Bapst , Alvaro Sanchez-Gonzalez , Vinicius Zambaldi , Mateusz Malinowski , Andrea Tacchetti , David Raposo , Adam Santoro , Ryan Faulkner et\u00a0al . 2018 . Relational inductive biases, deep learning, and graph networks. Retrieved from https:\/\/arXiv:1806.01261. Peter W Battaglia, Jessica B Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner et\u00a0al. 2018. Relational inductive biases, deep learning, and graph networks. Retrieved from https:\/\/arXiv:1806.01261."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389013"},{"key":"e_1_2_1_8_1","unstructured":"Scott Beamer Krste Asanovi\u0107 and David Patterson. 2015. The GAP Benchmark Suite. Retrieved from https:\/\/arXiv:cs.DC\/1508.03619.  Scott Beamer Krste Asanovi\u0107 and David Patterson. 2015. The GAP Benchmark Suite. Retrieved from https:\/\/arXiv:cs.DC\/1508.03619."},{"key":"e_1_2_1_9_1","volume-title":"Workshops and PhD Forum. IEEE, 1618\u20131627","author":"Beamer Scott","year":"2013","unstructured":"Scott Beamer , Aydin Buluc , Krste Asanovic , and David Patterson . 2013 . Distributed memory breadth-first search revisited: Enabling bottom-up search. In Proceeding sof the IEEE International Symposium on Parallel & Distributed Processing , Workshops and PhD Forum. IEEE, 1618\u20131627 . Scott Beamer, Aydin Buluc, Krste Asanovic, and David Patterson. 2013. Distributed memory breadth-first search revisited: Enabling bottom-up search. In Proceeding sof the IEEE International Symposium on Parallel & Distributed Processing, Workshops and PhD Forum. IEEE, 1618\u20131627."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_12_1","unstructured":"Aydin Buluc Scott Beamer Kamesh Madduri Krste Asanovic and David Patterson. 2017. Distributed-memory breadth-first search on massive graphs. Retrieved from https:\/\/arXiv:1705.04590.  Aydin Buluc Scott Beamer Kamesh Madduri Krste Asanovic and David Patterson. 2017. Distributed-memory breadth-first search on massive graphs. Retrieved from https:\/\/arXiv:1705.04590."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/971617.971643"},{"key":"e_1_2_1_17_1","first-page":"640","article-title":"Graphh: A processing-in-memory architecture for large-scale graph processing","volume":"34","author":"Dai Guohao","year":"2018","unstructured":"Guohao Dai , Tianhao Huang , Yuze Chi , Jishen Zhao , Guangyu Sun , Yongpan Liu , Yu Wang , Yuan Xie , and Huazhong Yang . 2018 . Graphh: A processing-in-memory architecture for large-scale graph processing . IEEE Trans. Comput.-Aided Design Integr. Circ. Syst. 34 , 4 (2018), 640 \u2013 653 . Guohao Dai, Tianhao Huang, Yuze Chi, Jishen Zhao, Guangyu Sun, Yongpan Liu, Yu Wang, Yuan Xie, and Huazhong Yang. 2018. Graphh: A processing-in-memory architecture for large-scale graph processing. IEEE Trans. Comput.-Aided Design Integr. Circ. Syst. 34, 4 (2018), 640\u2013653.","journal-title":"IEEE Trans. Comput.-Aided Design Integr. Circ. Syst."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192404"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.9.853"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035942"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.22"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96983-1_18"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 10th USENIX Conference 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 Conference on Operating Systems Design and Implementation (OSDI\u201912) . USENIX Association, Berkeley, CA, 17\u201330. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387883. 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 Conference on Operating Systems Design and Implementation (OSDI\u201912). USENIX Association, Berkeley, CA, 17\u201330. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387883."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201914)","author":"Gonzalez Joseph E.","year":"2014","unstructured":"Joseph E. Gonzalez , Reynold S. Xin , Ankur Dave , Daniel Crankshaw , Michael J. Franklin , and Ion Stoica . 2014 . GraphX: Graph processing in a distributed dataflow framework . In Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201914) . USENIX Association, Berkeley, CA, 599\u2013613. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=2685048.2685096. Joseph E. Gonzalez, Reynold S. Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, and Ion Stoica. 2014. GraphX: Graph processing in a distributed dataflow framework. In Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201914). USENIX Association, Berkeley, CA, 599\u2013613. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=2685048.2685096."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguistics, 1069\u20131080","author":"Goyal Amit","year":"2012","unstructured":"Amit Goyal , Hal Daum\u00e9 III, and Raul Guerra . 2012 . Fast large-scale approximate graph construction for nlp . In Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguistics, 1069\u20131080 . Amit Goyal, Hal Daum\u00e9 III, and Raul Guerra. 2012. Fast large-scale approximate graph construction for nlp. In Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguistics, 1069\u20131080."},{"key":"e_1_2_1_27_1","unstructured":"Graph500. 2010. Graph 500 Benchmarks. Retrieved from http:\/\/www.graph500.org.  Graph500. 2010. Graph 500 Benchmarks. Retrieved from http:\/\/www.graph500.org."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572034"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783759"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2248487.2151013"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807620"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503246"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2524211.2524218"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2016.12"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2010.2091686"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2523721.2523744"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.1558"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the IEEE International Solid-State Circuits Conference Digest of Technical Papers (ISSCC\u201914)","author":"Lee Dong Uk","year":"2014","unstructured":"Dong Uk Lee , Kyung Whan Kim , Kwan Weon Kim , Hongjung Kim , Ju Young Kim , Young Jun Park , Jae Hwan Kim , Dae Suk Kim , Heat Bit Park , Jin Wook Shin , et\u00a0al. 2014 . 25.2 A 1.2 V 8Gb 8-channel 128GB\/s high-bandwidth memory (HBM) stacked DRAM with effective microbump I\/O test methods using 29nm process and TSV . In Proceedings of the IEEE International Solid-State Circuits Conference Digest of Technical Papers (ISSCC\u201914) . IEEE, 432\u2013433. Dong Uk Lee, Kyung Whan Kim, Kwan Weon Kim, Hongjung Kim, Ju Young Kim, Young Jun Park, Jae Hwan Kim, Dae Suk Kim, Heat Bit Park, Jin Wook Shin, et\u00a0al. 2014. 25.2 A 1.2 V 8Gb 8-channel 128GB\/s high-bandwidth memory (HBM) stacked DRAM with effective microbump I\/O test methods using 29nm process and TSV. In Proceedings of the IEEE International Solid-State Circuits Conference Digest of Technical Papers (ISSCC\u201914). IEEE, 432\u2013433."},{"key":"e_1_2_1_41_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. friendster. Retrieved from https:\/\/snap.stanford.edu\/data\/com-Friendster.html.  Jure Leskovec and Andrej Krevl. 2014. friendster. Retrieved from https:\/\/snap.stanford.edu\/data\/com-Friendster.html."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"volume-title":"Proceedings of the 42nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201909)","author":"Li Sheng","key":"e_1_2_1_43_1","unstructured":"Sheng Li , Jung Ho Ahn , Richard D. Strong , Jay B. Brockman , Dean M. Tullsen , and Norman P. Jouppi . 2009. McPAT: An integrated power, area, and timing modeling framework for multicore and manycore architectures . In Proceedings of the 42nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201909) . 469\u2013480. Sheng Li, Jung Ho Ahn, Richard D. Strong, Jay B. Brockman, Dean M. Tullsen, and Norman P. Jouppi. 2009. McPAT: An integrated power, area, and timing modeling framework for multicore and manycore architectures. In Proceedings of the 42nd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO\u201909). 469\u2013480."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303974"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the 25th International Conference on Neural Information Processing Systems (NIPS\u201912)","author":"McAuley Julian","year":"2012","unstructured":"Julian McAuley and Jure Leskovec . 2012 . Learning to discover social circles in ego networks . In Proceedings of the 25th International Conference on Neural Information Processing Systems (NIPS\u201912) . Curran Associates, 539\u2013547. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=2999134.2999195. Julian McAuley and Jure Leskovec. 2012. Learning to discover social circles in ego networks. In Proceedings of the 25th International Conference on Neural Information Processing Systems (NIPS\u201912). Curran Associates, 539\u2013547. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=2999134.2999195."},{"key":"e_1_2_1_49_1","unstructured":"Frank McSherry. 2017. COST in the land of databases. Retrieved from https:\/\/github.com\/frankmcsherry\/blog\/blob\/master\/posts\/2017-09-23.md.  Frank McSherry. 2017. COST in the land of databases. Retrieved from https:\/\/github.com\/frankmcsherry\/blog\/blob\/master\/posts\/2017-09-23.md."},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 15th Workshop on Hot Topics in Operating Systems (HotOS\u201915)","author":"McSherry Frank","year":"2015","unstructured":"Frank McSherry , Michael Isard , and Derek G Murray . 2015 . Scalability! But at what {COST}? In Proceedings of the 15th Workshop on Hot Topics in Operating Systems (HotOS\u201915) . Frank McSherry, Michael Isard, and Derek G Murray. 2015. Scalability! But at what {COST}? In Proceedings of the 15th Workshop on Hot Topics in Operating Systems (HotOS\u201915)."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021819901281"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00010"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.54"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_2_1_55_1","unstructured":"The University of Texas at Austin. 2019. Texas Advanced Computing Center (TACC). Retrieved from https:\/\/www.tacc.utexas.edu\/.  The University of Texas at Austin. 2019. Texas Advanced Computing Center (TACC). Retrieved from https:\/\/www.tacc.utexas.edu\/."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.24"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_2_1_59_1","unstructured":"The Lemur Project. 2013. The ClueWeb12 Dataset. Retrieved from http:\/\/lemurproject.org\/clueweb12\/.  The Lemur Project. 2013. The ClueWeb12 Dataset. Retrieved from http:\/\/lemurproject.org\/clueweb12\/."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.11.002"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485963"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556572"},{"volume-title":"Proceedings of the 46th Annual IEEE\/ACM International Symposium on Microarchitecture. ACM, 198\u2013209","author":"Shevgoor Manjunath","key":"e_1_2_1_66_1","unstructured":"Manjunath Shevgoor , Jung-Sik Kim , Niladrish Chatterjee , Rajeev Balasubramonian , Al Davis , and Aniruddha N. Udipi . 2013. Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device . In Proceedings of the 46th Annual IEEE\/ACM International Symposium on Microarchitecture. ACM, 198\u2013209 . Manjunath Shevgoor, Jung-Sik Kim, Niladrish Chatterjee, Rajeev Balasubramonian, Al Davis, and Aniruddha N. Udipi. 2013. Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device. In Proceedings of the 46th Annual IEEE\/ACM International Symposium on Microarchitecture. ACM, 198\u2013209."},{"key":"e_1_2_1_67_1","unstructured":"Julian Shun. 2019. K-Core. Retrieved from http:\/\/jshun.github.io\/ligra\/docs\/tutorial_kcore.html.  Julian Shun. 2019. K-Core. Retrieved from http:\/\/jshun.github.io\/ligra\/docs\/tutorial_kcore.html."},{"volume-title":"Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201913)","author":"Shun Julian","key":"e_1_2_1_68_1","unstructured":"Julian Shun and Guy E. Blelloch . 2013. Ligra: A lightweight graph processing framework for shared memory . In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201913) . ACM, New York, NY, 135\u2013146. DOI:https:\/\/doi.org\/10.1145\/2442516.2442530 Julian Shun and Guy E. Blelloch. 2013. Ligra: A lightweight graph processing framework for shared memory. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201913). ACM, New York, NY, 135\u2013146. DOI:https:\/\/doi.org\/10.1145\/2442516.2442530"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994522"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/61.19245"},{"volume-title":"Managing and Mining Graph Data","author":"Tang Lei","key":"e_1_2_1_71_1","unstructured":"Lei Tang and Huan Liu . 2010. Graph mining applications to social network analysis . In Managing and Mining Graph Data . Springer , 487\u2013513. Lei Tang and Huan Liu. 2010. Graph mining applications to social network analysis. In Managing and Mining Graph Data. Springer, 487\u2013513."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080214"},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the USENIX Conference on Usenix Annual Technical Conference (USENIX ATC\u201919)","author":"Vora Keval","year":"2019","unstructured":"Keval Vora . 2019 . LUMOS: Dependency-driven disk-based graph processing . In Proceedings of the USENIX Conference on Usenix Annual Technical Conference (USENIX ATC\u201919) . USENIX Association, USA, 429\u2013442. Keval Vora. 2019. LUMOS: Dependency-driven disk-based graph processing. In Proceedings of the USENIX Conference on Usenix Annual Technical Conference (USENIX ATC\u201919). USENIX Association, USA, 429\u2013442."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660227"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"e_1_2_1_77_1","unstructured":"English Wikipedia. 2013. enwiki-2013. Retrieved from http:\/\/law.di.unimi.it\/webdata\/enwiki-2013\/.  English Wikipedia. 2013. enwiki-2013. Retrieved from http:\/\/law.di.unimi.it\/webdata\/enwiki-2013\/."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806849"},{"key":"e_1_2_1_79_1","volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201917)","author":"Xiao Wencong","year":"2017","unstructured":"Wencong Xiao , Jilong Xue , Youshan Miao , Zhen Li , Cheng Chen , Ming Wu , Wei Li , and Lidong Zhou . 2017 . Tux2: Distributed graph computation for machine learning . In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201917) . USENIX Association, Berkeley, CA, 669\u2013682. Wencong Xiao, Jilong Xue, Youshan Miao, Zhen Li, Cheng Chen, Ming Wu, Wei Li, and Lidong Zhou. 2017. Tux2: Distributed graph computation for machine learning. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201917). USENIX Association, Berkeley, CA, 669\u2013682."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629600"},{"key":"e_1_2_1_81_1","volume-title":"Proceedings of the TextGraphs-2 Workshop (NAACL-HLT\u201907)","author":"Zesch Torsten","year":"2007","unstructured":"Torsten Zesch and Iryna Gurevych . 2007 . Analysis of the Wikipedia category graph for NLP applications . In Proceedings of the TextGraphs-2 Workshop (NAACL-HLT\u201907) . 1\u20138. Torsten Zesch and Iryna Gurevych. 2007. Analysis of the Wikipedia category graph for NLP applications. In Proceedings of the TextGraphs-2 Workshop (NAACL-HLT\u201907). 1\u20138."},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.5555\/3026877.3026900"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00053"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276491"},{"key":"e_1_2_1_85_1","volume-title":"Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201916)","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 Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201916) . USENIX Association, Berkeley, CA, 301\u2013316. http:\/\/dl.acm.org\/citation.cfm?id=3026877.3026901 Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A computation-centric distributed graph processing system. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201916). USENIX Association, Berkeley, CA, 301\u2013316. http:\/\/dl.acm.org\/citation.cfm?id=3026877.3026901"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358256"}],"container-title":["ACM Transactions on Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453681","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:48Z","timestamp":1750193268000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,30]]},"references-count":85,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2019,11,30]]}},"alternative-id":["10.1145\/3453681"],"URL":"https:\/\/doi.org\/10.1145\/3453681","relation":{},"ISSN":["0734-2071","1557-7333"],"issn-type":[{"type":"print","value":"0734-2071"},{"type":"electronic","value":"1557-7333"}],"subject":[],"published":{"date-parts":[[2019,11,30]]},"assertion":[{"value":"2020-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}