{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T19:59:00Z","timestamp":1782417540098,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["CUHK14208521"],"award-info":[{"award-number":["CUHK14208521"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2208317"],"award-info":[{"award-number":["2208317"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2343863"],"award-info":[{"award-number":["2343863"]}],"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":[[2024,4,27]]},"DOI":"10.1145\/3620665.3640409","type":"proceedings-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T14:18:06Z","timestamp":1713795486000},"page":"467-481","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Grafu: Unleashing the Full Potential of Future Value Computation for Out-of-core Synchronous Graph Processing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8992-480X","authenticated-orcid":false,"given":"Tsun-Yu","family":"Yang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1467-0748","authenticated-orcid":false,"given":"Cale","family":"England","sequence":"additional","affiliation":[{"name":"Oklahoma State University, Stillwater, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1909-6239","authenticated-orcid":false,"given":"Yi","family":"Li","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas, Richardson, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5815-9706","authenticated-orcid":false,"given":"Bingzhe","family":"Li","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas, Richardson, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4029-757X","authenticated-orcid":false,"given":"Ming-Chang","family":"Yang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,4,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"125","volume-title":"2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"Ai Zhiyuan","year":"2017","unstructured":"Zhiyuan Ai, Mingxing Zhang, Yongwei Wu, Xuehai Qian, Kang Chen, and Weimin Zheng. Squeezing out all the value of loaded data: An out-of-core graph processing system with reduced disk i\/o. In 2017 USENIX Annual Technical Conference (USENIX ATC 17), pages 125--137, Santa Clara, CA, July 2017. USENIX Association."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2858250"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/59912"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 26th International Conference on World Wide Web, WWW '17, page 967--976, Republic and Canton of Geneva, CHE, 2017. International World Wide Web Conferences Steering Committee.","author":"Chen Wei","unstructured":"Wei Chen and Shang-Hua Teng. Interplay between social influence and network centrality: A comparative study on shapley centrality and single-node-influence centrality. In Proceedings of the 26th International Conference on World Wide Web, WWW '17, page 967--976, Republic and Canton of Geneva, CHE, 2017. International World Wide Web Conferences Steering Committee."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2968456.2968473"},{"key":"e_1_3_2_1_8_1","unstructured":"Friendster dataset from SNAP. https:\/\/snap.stanford.edu\/data\/com-Friendster.html."},{"key":"e_1_3_2_1_9_1","volume-title":"http:\/\/law.di.unimi.it\/webdata\/twitter-2010\/","author":"WebGraph Twitter","year":"2010","unstructured":"Twitter dataset from WebGraph. http:\/\/law.di.unimi.it\/webdata\/twitter-2010\/, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"e_1_3_2_1_11_1","first-page":"03","article-title":"Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons","volume":"71","author":"Dubhashi Devdatt","year":"2003","unstructured":"Devdatt Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, and Aravind Srinivasan. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. Journal of Computer and System Sciences, 71, 03 2003.","journal-title":"Journal of Computer and System Sciences"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3323298.3323327"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"e_1_3_2_1_15_1","volume-title":"Graph coloring problems","author":"Jensen Tommy R","year":"2011","unstructured":"Tommy R Jensen and Bjarne Toft. Graph coloring problems. John Wiley & Sons, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1038\/35075138"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00042"},{"key":"e_1_3_2_1_18_1","volume-title":"Inference of beliefs on billion-scale graphs","author":"Kang U","year":"2010","unstructured":"U Kang, Duen Horng, et al. Inference of beliefs on billion-scale graphs. 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.15"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijinfomgt.2017.08.003"},{"key":"e_1_3_2_1_22_1","first-page":"31","volume-title":"10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. Graphchi: Large-scale graph computation on just a PC. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12), pages 31--46, Hollywood, CA, October 2012. USENIX Association."},{"key":"e_1_3_2_1_23_1","first-page":"459","volume-title":"2019 USENIX Annual Technical Conference (USENIX ATC 19)","author":"Lee Eunjae","year":"2019","unstructured":"Eunjae Lee, Junghyun Kim, Keunhak Lim, Sam H Noh, and Jiwon Seo. {Pre-Select} static caching and neighborhood ordering for {BFS-like} algorithms on disk-based graph engines. In 2019 USENIX Annual Technical Conference (USENIX ATC 19), pages 459--474, 2019."},{"key":"e_1_3_2_1_24_1","unstructured":"Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_25_1","first-page":"285","volume-title":"15th USENIX Conference on File and Storage Technologies (FAST 17)","author":"Liu Hang","year":"2017","unstructured":"Hang Liu and H. Howie Huang. Graphene: Fine-grained IO management for graph computing. In 15th USENIX Conference on File and Storage Technologies (FAST 17), pages 285--300, Santa Clara, CA, February 2017. USENIX Association."},{"key":"e_1_3_2_1_26_1","first-page":"195","volume-title":"2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"Ma Lingxiao","year":"2017","unstructured":"Lingxiao Ma, Zhi Yang, Han Chen, Jilong Xue, and Yafei Dai. Garaph: Efficient {GPU-accelerated} graph processing on a single machine with balanced replication. In 2017 USENIX Annual Technical Conference (USENIX ATC 17), pages 195--207, 2017."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.062413"},{"key":"e_1_3_2_1_29_1","unstructured":"mlock --- Linux manual page. https:\/\/man7.org\/linux\/man-pages\/man2\/mlock.2.html."},{"key":"e_1_3_2_1_30_1","first-page":"285","volume-title":"Proceedings of the International Symposium on the Switching Theory","author":"Moore Edward F.","year":"1959","unstructured":"Edward F. Moore. The shortest path through a maze. In Proceedings of the International Symposium on the Switching Theory, 1959, pages 285--292."},{"key":"e_1_3_2_1_32_1","volume-title":"Stanford InfoLab","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3128571"},{"key":"e_1_3_2_1_35_1","unstructured":"Samsung 860 EVO SSD. https:\/\/www.samsung.com\/semiconductor\/minisite\/ssd\/product\/consumer\/860evo\/."},{"key":"e_1_3_2_1_36_1","volume-title":"http:\/\/law.di.unimi.it\/webdata\/uk-2007-01\/","year":"2007","unstructured":"uk-2007 dataset from WebGraph. http:\/\/law.di.unimi.it\/webdata\/uk-2007-01\/, 2007."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_38_1","first-page":"429","volume-title":"2019 USENIX Annual Technical Conference (USENIX ATC 19)","author":"Vora Keval","year":"2019","unstructured":"Keval Vora. LUMOS: Dependency-driven disk-based graph processing. In 2019 USENIX Annual Technical Conference (USENIX ATC 19), pages 429--442, Renton, WA, July 2019. USENIX Association."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_3_2_1_40_1","first-page":"507","volume-title":"2016 USENIX Annual Technical Conference (USENIX ATC 16)","author":"Vora Keval","year":"2016","unstructured":"Keval Vora, Guoqing Xu, and Rajiv Gupta. Load the edges you need: A generic i\/o optimization for disk-based graph processing. In 2016 USENIX Annual Technical Conference (USENIX ATC 16), pages 507--522, Denver, CO, June 2016. USENIX Association."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_42_1","first-page":"381","volume-title":"20th USENIX Conference on File and Storage Technologies (FAST 22)","author":"Yang Tsun-Yu","year":"2022","unstructured":"Tsun-Yu Yang, Yuhong Liang, and Ming-Chang Yang. Practicably boosting the processing performance of {BFS-like} algorithms on {Semi-External} graph system via {I\/O-Efficient} graph ordering. In 20th USENIX Conference on File and Storage Technologies (FAST 22), pages 381--396, 2022."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.2991\/msam-17.2017.68"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3296957.3173208"},{"key":"e_1_3_2_1_45_1","first-page":"45","volume-title":"13th USENIX Conference on File and Storage Technologies (FAST 15)","author":"Zheng Da","year":"2015","unstructured":"Da Zheng, Disa Mhembere, Randal Burns, Joshua Vogelstein, Carey E. Priebe, and Alexander S. Szalay. Flashgraph: Processing billion-node graphs on an array of commodity ssds. In 13th USENIX Conference on File and Storage Technologies (FAST 15), pages 45--58, Santa Clara, CA, February 2015. USENIX Association."},{"key":"e_1_3_2_1_46_1","volume-title":"Learning from labeled and unlabeled data with label propagation","author":"Zhu Xiaojin","year":"2002","unstructured":"Xiaojin Zhu and Zoubin Ghahramani. Learning from labeled and unlabeled data with label propagation. 2002."},{"key":"e_1_3_2_1_47_1","first-page":"375","volume-title":"2015 USENIX Annual Technical Conference (USENIX ATC 15)","author":"Zhu Xiaowei","year":"2015","unstructured":"Xiaowei Zhu, Wentao Han, and Wenguang Chen. Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In 2015 USENIX Annual Technical Conference (USENIX ATC 15), pages 375--386, Santa Clara, CA, July 2015. USENIX Association."}],"event":{"name":"ASPLOS '24: 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2","location":"La Jolla CA USA","acronym":"ASPLOS '24","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGOPS ACM Special Interest Group on Operating Systems","SIGPLAN ACM Special Interest Group on Programming Languages","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620665.3640409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3620665.3640409","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3620665.3640409","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3620665.3640409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:42Z","timestamp":1750291422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620665.3640409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,27]]},"references-count":46,"alternative-id":["10.1145\/3620665.3640409","10.1145\/3620665"],"URL":"https:\/\/doi.org\/10.1145\/3620665.3640409","relation":{},"subject":[],"published":{"date-parts":[[2024,4,27]]},"assertion":[{"value":"2024-04-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}