{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T20:02:40Z","timestamp":1784232160675,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["CCF-2226448, CCF-2002554"],"award-info":[{"award-number":["CCF-2226448, CCF-2002554"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1145\/3696443.3708960","type":"proceedings-article","created":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T11:50:26Z","timestamp":1740225026000},"page":"405-417","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["PreFix: Optimizing the Performance of Heap-Intensive Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7198-6766","authenticated-orcid":false,"given":"Chaitanya","family":"Mamatha Ananda","sequence":"first","affiliation":[{"name":"University of California, Riverside, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9348-3974","authenticated-orcid":false,"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California, Riverside, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6303-8132","authenticated-orcid":false,"given":"Sriraman","family":"Tallam","sequence":"additional","affiliation":[{"name":"Google, Mountain View, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9869-2591","authenticated-orcid":false,"given":"Han","family":"Shen","sequence":"additional","affiliation":[{"name":"Google, Mountain View, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4223-2796","authenticated-orcid":false,"given":"Xinliang David","family":"Li","sequence":"additional","affiliation":[{"name":"Google, Mountain View, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS61541.2024.00046"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2618128.2618132"},{"key":"e_1_3_2_1_3_1","unstructured":"Todd Austin. 1995. The Pointer-intensive Benchmark Suite. https:\/\/pages.cs.wisc.edu\/ austin\/ptr-dist.html"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155108"},{"key":"e_1_3_2_1_5_1","volume-title":"Bruening and Saman Amarasinghe","author":"Derek","year":"2004","unstructured":"Derek L. Bruening and Saman Amarasinghe. 2004. Efficient, transparent, and comprehensive runtime code manipulation. AAI0807735."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/291069.291036"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301633"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134011"},{"key":"e_1_3_2_1_9_1","volume-title":"Untangling Lifetimes: The Arena Allocator. https:\/\/www.rfleury.com\/p\/untangling-lifetimes-the-arena-allocator [Online","author":"Fleury Ryan","year":"2022","unstructured":"Ryan Fleury. 2022. Untangling Lifetimes: The Arena Allocator. https:\/\/www.rfleury.com\/p\/untangling-lifetimes-the-arena-allocator [Online; accessed August-2024]."},{"key":"e_1_3_2_1_10_1","unstructured":"GeeksforGeeks. Longest Common Subsequence. https:\/\/www.geeksforgeeks.org\/longest-common-subsequence-dp-4\/"},{"key":"e_1_3_2_1_11_1","volume-title":"15th $USENIX$ Symposium on Operating Systems Design and Implementation ($OSDI$ 21). 257\u2013273.","author":"Hunter Andrew Hamilton","unstructured":"Andrew Hamilton Hunter, Chris Kennelly, Paul Turner, Darryl Gove, Tipp Moseley, and Parthasarathy Ranganathan. 2021. Beyond malloc efficiency to fleet efficiency: a hugepage-aware memory allocator. In 15th $USENIX$ Symposium on Operating Systems Design and Implementation ($OSDI$ 21). 257\u2013273."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/353926.353937"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065027"},{"key":"e_1_3_2_1_14_1","volume-title":"SPEC CPU2006 Benchmark Description. https:\/\/www.spec.org\/cpu2006\/Docs\/429.mcf.html [Online","author":"Lobel Andreas","year":"2024","unstructured":"Andreas Lobel. 2011. 429.mcf: SPEC CPU2006 Benchmark Description. https:\/\/www.spec.org\/cpu2006\/Docs\/429.mcf.html [Online; accessed August-2024]."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Craig Nevill-Manning and Ian Witten. 1997. Linear-time incremental hierarchy inference for compression. 3\u201311. isbn:0-8186-7761-9 https:\/\/doi.org\/10.1109\/DCC.1997.581951 10.1109\/DCC.1997.581951","DOI":"10.1109\/DCC.1997.581951"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661201"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/201059.201065"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503287"},{"key":"e_1_3_2_1_19_1","unstructured":"Peter Rundberg and Fredrik Warg. 1995. The FreeBench v1.03 Benchmark Suite. https:\/\/web.archive.org\/web\/20020601092519\/http:\/\/www.freebench.org\/"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Joe Savage and Timothy M Jones. 2019. Research data supporting \"HALO: Post-Link Heap-Layout Optimisation\". Apollo - University of Cambridge Repository.. https:\/\/doi.org\/10.17863\/cam.46071 10.17863\/cam.46071","DOI":"10.17863\/cam.46071"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377914"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/291006.291012"},{"key":"e_1_3_2_1_23_1","volume-title":"SPEC CPU2017","author":"Standard Performance Evaluation Corporation","year":"2017","unstructured":"Standard Performance Evaluation Corporation. 2017. SPEC CPU2017. https:\/\/www.spec.org\/cpu2017"},{"key":"e_1_3_2_1_24_1","volume-title":"https:\/\/protobuf.dev\/reference\/cpp\/arenas\/ [Online","author":"Team Protocol Buffer","year":"2024","unstructured":"Protocol Buffer Team. 2022. C++ Arena Allocation Guide. https:\/\/protobuf.dev\/reference\/cpp\/arenas\/ [Online; accessed August-2024]."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.1998.727268"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772969"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2086696.2086705"},{"key":"e_1_3_2_1_28_1","volume-title":"Arena Allocator tips and tricks. https:\/\/nullprogram.com\/blog\/2023\/09\/27\/ [Online","author":"Wellons Chris","year":"2024","unstructured":"Chris Wellons. 2023. Arena Allocator tips and tricks. https:\/\/nullprogram.com\/blog\/2023\/09\/27\/ [Online; accessed August-2024]."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2014.6844459"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/647478.727939"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127577.1127584"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3620666.3651350"}],"event":{"name":"CGO '25: 23rd ACM\/IEEE International Symposium on Code Generation and Optimization","location":"Las Vegas NV USA","acronym":"CGO '25","sponsor":["SIGPLAN SIGPLAN Programming Languages","SIGMICRO SIGMICRO Microarchitecture","IEEE Computer Society IEEE Computer Society"]},"container-title":["Proceedings of the 23rd ACM\/IEEE International Symposium on Code Generation and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696443.3708960","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:13Z","timestamp":1750295413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696443.3708960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":32,"alternative-id":["10.1145\/3696443.3708960","10.1145\/3696443"],"URL":"https:\/\/doi.org\/10.1145\/3696443.3708960","relation":{},"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"2025-03-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}