{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:42:32Z","timestamp":1787017352701,"version":"build-2736575974"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF grants","award":["CCF-1910850, CNS-1925644, and CCF-2139612"],"award-info":[{"award-number":["CCF-1910850, CNS-1925644, and CCF-2139612"]}]},{"name":"GA?R EXPRO grant","award":["23-07580X (RiGID)"],"award-info":[{"award-number":["23-07580X (RiGID)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2023,10,16]]},"abstract":"<jats:p>\n                    Most code is executed more than once. If not entire programs then libraries remain unchanged from one run to the next. Just-in-time compilers expend considerable effort gathering insights about code they compiled many times, and often end up generating the same binary over and over again. We explore how to reuse compiled code across runs of different programs to reduce warm-up costs of dynamic languages. We propose to use\n                    <jats:italic>speculative contextual dispatch<\/jats:italic>\n                    to select versions of functions from an\n                    <jats:italic>off-line curated code repository<\/jats:italic>\n                    . That repository is a persistent database of previously compiled functions indexed by the context under which they were compiled. The repository is curated to remove redundant code and to optimize dispatch. We assess practicality by extending \u0158, a compiler for the R language, and evaluating its performance. Our results suggest that the approach improves warmup times while preserving peak performance.\n                  <\/jats:p>","DOI":"10.1145\/3622839","type":"journal-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T11:41:29Z","timestamp":1697456489000},"page":"1176-1197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Reusing Just-in-Time Compiled Code"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1371-5483","authenticated-orcid":false,"given":"Meetesh Kalpesh","family":"Mehta","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Mandi, Mandi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4124-0225","authenticated-orcid":false,"given":"Sebasti\u00e1n","family":"Krynski","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague, Prague, Czechia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2444-1209","authenticated-orcid":false,"given":"Hugo Musso","family":"Gualandi","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague, Prague, Czechia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0740-9701","authenticated-orcid":false,"given":"Manas","family":"Thakur","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4052-3458","authenticated-orcid":false,"given":"Jan","family":"Vitek","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094835"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359619.3359744"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428288"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523729"},{"key":"e_1_2_1_5_1","volume-title":"Recommenderlab: An R framework for developing and testing recommendation algorithms. arXiv:2205.12371 [cs.IR]. May, https:\/\/doi.org\/10.48550\/ARXIV.2205.12371","author":"Hahsler Michael","year":"2022","unstructured":"Michael Hahsler . 2022 . Recommenderlab: An R framework for developing and testing recommendation algorithms. arXiv:2205.12371 [cs.IR]. May, https:\/\/doi.org\/10.48550\/ARXIV.2205.12371 10.48550\/ARXIV.2205.12371 Michael Hahsler. 2022. Recommenderlab: An R framework for developing and testing recommendation algorithms. arXiv:2205.12371 [cs.IR]. May, https:\/\/doi.org\/10.48550\/ARXIV.2205.12371"},{"key":"e_1_2_1_6_1","unstructured":"Urs Holzle. 1994. Adaptive optimization for self: Reconciling high performance with exploratory programming. Ph. D. Dissertation. isbn:979-8-208-91619-3 https:\/\/www.proquest.com\/dissertations-theses\/adaptive-optimization-self-reconciling-high\/docview\/304113365\/se-2 Copyright - Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works; Last updated - 2023-02-23 \t\t\t\t  Urs Holzle. 1994. Adaptive optimization for self: Reconciling high performance with exploratory programming. Ph. D. Dissertation. isbn:979-8-208-91619-3 https:\/\/www.proquest.com\/dissertations-theses\/adaptive-optimization-self-reconciling-high\/docview\/304113365\/se-2 Copyright - Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works; Last updated - 2023-02-23"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377902"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576195.2576205"},{"key":"e_1_2_1_9_1","volume-title":"JITServer: Disaggregated Caching JIT Compiler for the JVM in the Cloud. In 2022 USENIX Annual Technical Conference (USENIX ATC 22)","author":"Khrabrov Alexey","year":"2022","unstructured":"Alexey Khrabrov , Marius Pirvu , Vijay Sundaresan , and Eyal de Lara . 2022 . JITServer: Disaggregated Caching JIT Compiler for the JVM in the Cloud. In 2022 USENIX Annual Technical Conference (USENIX ATC 22) . USENIX Association, Carlsbad, CA. 869\u2013884. isbn:978-1-939133-29-62 https:\/\/www.usenix.org\/conference\/atc22\/presentation\/khrabrov Alexey Khrabrov, Marius Pirvu, Vijay Sundaresan, and Eyal de Lara. 2022. JITServer: Disaggregated Caching JIT Compiler for the JVM in the Cloud. In 2022 USENIX Annual Technical Conference (USENIX ATC 22). USENIX Association, Carlsbad, CA. 869\u2013884. isbn:978-1-939133-29-62 https:\/\/www.usenix.org\/conference\/atc22\/presentation\/khrabrov"},{"key":"e_1_2_1_10_1","unstructured":"Mike Love Rafael Irizarry and Vince Carey. 2013. Genomicsclass\/labs: RMD source files for the Harvardx series ph525x. github.com\/genomicsclass\/labs \t\t\t\t  Mike Love Rafael Irizarry and Vince Carey. 2013. Genomicsclass\/labs: RMD source files for the Harvardx series ph525x. github.com\/genomicsclass\/labs"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.8330884"},{"key":"e_1_2_1_12_1","unstructured":"Tyler Morgan. 2008. Throwing Shade Ray Tracer. www.tylermw.com\/throwing-shade\/ \t\t\t\t  Tyler Morgan. 2008. Throwing Shade Ray Tracer. www.tylermw.com\/throwing-shade\/"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370314"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.29"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3473575"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2989225.2989236"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370825"},{"key":"e_1_2_1_18_1","unstructured":"Luke Tierney. 2019. A Byte Code Compiler for R. www.stat.uiowa.edu\/~luke\/R\/compiler\/compiler.pdf \t\t\t\t  Luke Tierney. 2019. A Byte Code Compiler for R. www.stat.uiowa.edu\/~luke\/R\/compiler\/compiler.pdf"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2581122.2544153"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360610"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509578.2509581"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276494"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1134\/S036176881701008X"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622839","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3622839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:37:04Z","timestamp":1750163824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":23,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2023,10,16]]}},"alternative-id":["10.1145\/3622839"],"URL":"https:\/\/doi.org\/10.1145\/3622839","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"2023-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}