{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:43Z","timestamp":1750309303702,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":93,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100006168","name":"National Nuclear Security Administration","doi-asserted-by":"publisher","award":["DE-NA0003969"],"award-info":[{"award-number":["DE-NA0003969"]}],"id":[{"id":"10.13039\/100006168","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-22-C-0085"],"award-info":[{"award-number":["W911NF-22-C-0085"]}],"id":[{"id":"10.13039\/100000183","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.3640421","type":"proceedings-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T14:18:06Z","timestamp":1713795486000},"page":"566-581","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Kimbap: A Node-Property Map System for Distributed Graph Analytics"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7158-6633","authenticated-orcid":false,"given":"Hochan","family":"Lee","sequence":"first","affiliation":[{"name":"Computer Science, The University of Texas at Austin, Austin, Texas, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8815-7468","authenticated-orcid":false,"given":"Roshan","family":"Dathathri","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, Washington, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0484-4636","authenticated-orcid":false,"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[{"name":"Computer Science, The University of Texas at Austin, Austin, Texas, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2024,4,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Giraph. http:\/\/giraph.apache.org."},{"key":"e_1_3_2_1_2_1","unstructured":"libmemcached. https:\/\/libmemcached.org."},{"key":"e_1_3_2_1_3_1","unstructured":"Neo4j. https:\/\/neo4j.com\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Redis. http:\/\/redis.io\/."},{"key":"e_1_3_2_1_5_1","unstructured":"The Parallel Hashmap. https:\/\/github.com\/greg7mdp\/parallel-hashmap."},{"key":"e_1_3_2_1_6_1","unstructured":"Tigergraph. https:\/\/www.tigergraph.com\/."},{"key":"e_1_3_2_1_7_1","volume-title":"The University of Texas at Austin","author":"Texas Advanced Computing Center (TACC)","year":"2018","unstructured":"Texas Advanced Computing Center (TACC), The University of Texas at Austin, 2018."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/6448"},{"key":"e_1_3_2_1_9_1","first-page":"58","article-title":"A localized distributed algorithm for vertex cover problem","author":"Akram Vahid Khalilpour","year":"2022","unstructured":"Vahid Khalilpour Akram and Onur Ugurlu. A localized distributed algorithm for vertex cover problem. Journal of Computational Science, 58, 2022.","journal-title":"Journal of Computational Science"},{"key":"e_1_3_2_1_10_1","first-page":"18","volume-title":"Computer","author":"Amza Cristiana","year":"1996","unstructured":"Cristiana Amza, Alan L Cox, Sandhya Dwarkadas, Pete Keleher, Honghui Lu, Ramakrishnan Rajamony, Weimin Yu, and Willy Zwaenepoel. Treadmarks: shared memory computing on networks of workstations. Computer, pages 18--28, 1996."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"volume-title":"Proceedings of the VLDB Endowment, 13(13)","author":"Behnezhad Soheil","key":"e_1_3_2_1_12_1","unstructured":"Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab Mirrokni, and Warren Schudy. Parallel graph algorithms in constant adaptive rounds: Theory meets practice. Proceedings of the VLDB Endowment, 13(13)."},{"key":"e_1_3_2_1_13_1","volume-title":"Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment","author":"Blondel Vincent D","year":"2008","unstructured":"Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10):P10008, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503293"},{"key":"e_1_3_2_1_15_1","first-page":"153","article-title":"Contribution to the solution of a problem of economical construction of electrical networks","volume":"15","author":"Boruvka Otakar","year":"1926","unstructured":"Otakar Boruvka. Contribution to the solution of a problem of economical construction of electrical networks. Elektronick\u1ef3 Obzor, 15:153--154, 1926.","journal-title":"Elektronick\u1ef3 Obzor"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370321"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3291525"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236209"},{"key":"e_1_3_2_1_19_1","volume-title":"Apache flink: Stream and batch processing in a single engine. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 36(4)","author":"Carbone Paris","year":"2015","unstructured":"Paris Carbone, Asterios Katsifodimos, Stephan Ewen, Volker Markl, Seif Haridi, and Kostas Tzoumas. Apache flink: Stream and batch processing in a single engine. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 36(4), 2015."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1119"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342007078442"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809028.1806638"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196898"},{"key":"e_1_3_2_1_24_1","first-page":"519","volume-title":"ACM SIGPLAN NOTICES","author":"Charles Philippe","year":"2005","unstructured":"Philippe Charles, Christian Grothoff, Vijay Saraswat, Christopher Donawa, Allan Kielstra, Kemal Ebcioglu, Christoph Von Praun, and Vivek Sarkar. X10: an object-oriented approach to non-uniform cluster computing. ACM SIGPLAN NOTICES, pages 519--538, 2005."},{"key":"e_1_3_2_1_25_1","volume-title":"ACM Transactions on Parallel Computing (TOPC)","author":"Chen Rong","year":"2019","unstructured":"Rong Chen, Jiaxin Shi, Yanzhe Chen, Binyu Zang, Haibing Guan, and Haibo Chen. Powerlyra: Differentiated graph computation and partitioning on skewed graphs. ACM Transactions on Parallel Computing (TOPC), 2019."},{"key":"e_1_3_2_1_26_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","year":"2022","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192404"},{"key":"e_1_3_2_1_28_1","first-page":"15","volume-title":"PACT'19","author":"Dathathri Roshan","year":"2019","unstructured":"Roshan Dathathri, Gurbinder Gill, Loc Hoang, Vishwesh Jatala, Keshav Pingali, V Krishna Nandivada, Hoang-Vu Dang, and Marc Snir. Gluonasync: A bulk-asynchronous system for distributed and heterogeneous graph analytics. In PACT'19, pages 15--28. IEEE, 2019."},{"key":"e_1_3_2_1_29_1","first-page":"615","volume-title":"ASP-LOS'19","author":"Dathathri Roshan","year":"2019","unstructured":"Roshan Dathathri, Gurbinder Gill, Loc Hoang, and Keshav Pingali. Phoenix: A substrate for resilient distributed graph analytics. In ASP-LOS'19, pages 615--630, 2019."},{"key":"e_1_3_2_1_30_1","volume-title":"Tigergraph: A native mpp graph database. arXiv preprint arXiv:1901.08248","author":"Deutsch Alin","year":"2019","unstructured":"Alin Deutsch, Yu Xu, Mingxi Wu, and Victor Lee. Tigergraph: A native mpp graph database. arXiv preprint arXiv:1901.08248, 2019."},{"key":"e_1_3_2_1_31_1","first-page":"439","volume-title":"On the hardness of approximating minimum vertex cover. Annals of mathematics","author":"Dinur Irit","year":"2005","unstructured":"Irit Dinur and Samuel Safra. On the hardness of approximating minimum vertex cover. Annals of mathematics, pages 439--485, 2005."},{"key":"e_1_3_2_1_32_1","first-page":"401","article-title":"Fast remote memory","volume":"14","author":"Dragojevi\u0107 Aleksandar","year":"2014","unstructured":"Aleksandar Dragojevi\u0107, Dushyanth Narayanan, Miguel Castro, and Orion Hodson. {FaRM}: Fast remote memory. In NSDI 14, pages 401--414, 2014.","journal-title":"NSDI"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1214527"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0159161"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1012889.1012894"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_3_2_1_37_1","volume-title":"https:\/\/i11www.iti.kit.edu\/resources\/roadgraphs.php","author":"Technologie Karlsruher Institut","year":"2014","unstructured":"Karlsruher Institut fur Technologie. OSM-Europe. https:\/\/i11www.iti.kit.edu\/resources\/roadgraphs.php, 2014."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00098"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96983-1_18"},{"key":"e_1_3_2_1_40_1","series-title":"PVLDB","volume-title":"A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms","author":"Gill Gurbinder","year":"2018","unstructured":"Gurbinder Gill, Roshan Dathathri, Loc Hoang, and Keshav Pingali. A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms. volume 12 of PVLDB, 2018."},{"key":"e_1_3_2_1_41_1","first-page":"17","volume-title":"OSDI'12","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. {PowerGraph}: Distributed {Graph-Parallel} computation on natural graphs. In OSDI'12, pages 17--30, 2012."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210284.3210297"},{"key":"e_1_3_2_1_43_1","volume-title":"Los Alamos National Lab.(LANL)","author":"Hagberg Aric","year":"2008","unstructured":"Aric Hagberg, Pieter Swart, and Daniel S Chult. Exploring network structure, dynamics, and function using networkx. Technical report, Los Alamos National Lab.(LANL), 2008."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941557"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1731011.1731013"},{"key":"e_1_3_2_1_46_1","volume-title":"Keshav Pingali. CuSP: A Customizable Streaming Edge Partitioner for Distributed Graph Analytics. In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019","author":"Hoang Loc","year":"2019","unstructured":"Loc Hoang, Roshan Dathathri, Gurbinder Gill, and Keshav Pingali. CuSP: A Customizable Streaming Edge Partitioner for Distributed Graph Analytics. In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019, 2019."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2524211.2524218"},{"key":"e_1_3_2_1_48_1","volume-title":"Grafs: Declarative graph analytics. (ICFP)","author":"Houshmand Farzin","year":"2021","unstructured":"Farzin Houshmand, Mohsen Lesani, and Keval Vora. Grafs: Declarative graph analytics. (ICFP), 2021."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749246.2749250"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582722"},{"issue":"3","key":"e_1_3_2_1_52_1","first-page":"1","article-title":"A comparison of network clustering algorithms in keyword network analysis: A case study with geography conference presentations","volume":"7","author":"Lee Youngho","year":"2020","unstructured":"Youngho Lee, Yubin Lee, Jeong Seong, Ana Stanescu, and Chul Sue Hwang. A comparison of network clustering algorithms in keyword network analysis: A case study with geography conference presentations. International Journal of Geospatial and Environmental Research, 7(3):1, 2020.","journal-title":"International Journal of Geospatial and Environmental Research"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2901919"},{"key":"e_1_3_2_1_54_1","unstructured":"Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data 2014."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00060-2"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_57_1","first-page":"443","article-title":"Parallel deep neural network computation on large graphs","volume":"19","author":"Ma Lingxiao","year":"2019","unstructured":"Lingxiao Ma, Zhi Yang, Youshan Miao, Jilong Xue, Ming Wu, Lidong Zhou, and Yafei Dai. {NeuGraph}: Parallel deep neural network computation on large graphs. In USENIX ATC 19, pages 443--458, 2019.","journal-title":"USENIX ATC"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2015.72"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.3389\/neuro.11.037.2009"},{"key":"e_1_3_2_1_61_1","volume-title":"Web data commons-hyperlink graphs. URL http:\/\/webdatacommons.org\/hyperlinkgraph\/index.html","author":"Meusel Robert","year":"2012","unstructured":"Robert Meusel, Oliver Lehmberg, Christian Bizer, and Sebastiano Vigna. Web data commons-hyperlink graphs. URL http:\/\/webdatacommons.org\/hyperlinkgraph\/index.html, 2012."},{"key":"e_1_3_2_1_62_1","first-page":"291","volume-title":"USENIX ATC'15","author":"Nelson Jacob","year":"2015","unstructured":"Jacob Nelson, Brandon Holt, Brandon Myers, Preston Briggs, Luis Ceze, Simon Kahan, and Mark Oskin. {Latency-Tolerant} software distributed shared memory. In USENIX ATC'15, pages 291--305, 2015."},{"key":"e_1_3_2_1_63_1","volume-title":"Finding and evaluating community structure in networks. Physical review E, 69(2):026113","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.1995.1002"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_69_1","volume-title":"The ClueWeb12 Dataset","author":"Project The Lemur","year":"2013","unstructured":"The Lemur Project. The ClueWeb12 Dataset, 2013."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442521"},{"key":"e_1_3_2_1_71_1","volume-title":"Market basket analysis with networks. Social network analysis and mining, 1:97--113","author":"Raeder Troy","year":"2011","unstructured":"Troy Raeder and Nitesh V Chawla. Market basket analysis with networks. Social network analysis and mining, 1:97--113, 2011."},{"key":"e_1_3_2_1_72_1","volume-title":"Near linear time algorithm to detect community structures in large-scale networks. Physical review E, 76(3):036106","author":"Raghavan Usha Nandini","year":"2007","unstructured":"Usha Nandini Raghavan, R\u00e9ka Albert, and Soundar Kumara. Near linear time algorithm to detect community structures in large-scale networks. Physical review E, 76(3):036106, 2007."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.277789"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/195473.195575"},{"key":"e_1_3_2_1_76_1","volume-title":"Journal of Algorithms","author":"Shiloach Yossi","year":"1982","unstructured":"Yossi Shiloach and Uzi Vishkin. An o(logn) parallel connectivity algorithm. Journal of Algorithms, 1982."},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093338.3093385"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159696"},{"key":"e_1_3_2_1_79_1","volume-title":"From louvain to leiden: guaranteeing well-connected communities. Scientific reports","author":"Traag Vincent A","year":"2019","unstructured":"Vincent A Traag, Ludo Waltman, and Nees Jan Van Eck. From louvain to leiden: guaranteeing well-connected communities. Scientific reports, 2019."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2714064.2660227"},{"key":"e_1_3_2_1_81_1","first-page":"223","volume-title":"ACM SIGARCH Computer Architecture News","author":"Vora Keval","year":"2017","unstructured":"Keval Vora, Chen Tian, Rajiv Gupta, and Ziang Hu. Coral: Confined recovery in distributed asynchronous graph processing. ACM SIGARCH Computer Architecture News, pages 223--236, 2017."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093337.3037747"},{"issue":"2","key":"e_1_3_2_1_83_1","first-page":"344","article-title":"A kvs for any scale","volume":"33","author":"Wu Chenggang","year":"2019","unstructured":"Chenggang Wu, Jose M Faleiro, Yihan Lin, and Joseph M Hellerstein. Anna: A kvs for any scale. IEEE Transactions on Knowledge and Data Engineering, 33(2):344--358, 2019.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_84_1","first-page":"669","volume-title":"NSDI'17","author":"Xiao Wencong","year":"2017","unstructured":"Wencong Xiao, Jilong Xue, Youshan Miao, Zhen Li, Cheng Chen, Ming Wu, Wei Li, and Lidong Zhou. Tux2: Distributed graph computation for machine learning. In NSDI'17, pages 669--682, 2017."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858788.2688508"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep30750"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290991"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2009.11.005"},{"key":"e_1_3_2_1_90_1","volume-title":"Graphit: A high-performance graph dsl. (OOPSLA)","author":"Zhang Yunming","year":"2018","unstructured":"Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi, Shoaib Kamil, Julian Shun, and Saman Amarasinghe. Graphit: A high-performance graph dsl. (OOPSLA), 2018."},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-17682"},{"key":"e_1_3_2_1_92_1","first-page":"301","volume-title":"OSDI'16","author":"Zhu Xiaowei","year":"2016","unstructured":"Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. Gemini: A {Computation-Centric} distributed graph processing system. In OSDI'16, pages 301--316, 2016."},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385961"}],"event":{"name":"ASPLOS '24: 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2","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"],"location":"La Jolla CA USA","acronym":"ASPLOS '24"},"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.3640421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3620665.3640421","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3620665.3640421","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3620665.3640421","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.3640421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,27]]},"references-count":93,"alternative-id":["10.1145\/3620665.3640421","10.1145\/3620665"],"URL":"https:\/\/doi.org\/10.1145\/3620665.3640421","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"}}]}}