{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:34:15Z","timestamp":1773192855737,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":[""],"award-info":[{"award-number":[""]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Electronics and Information technology (NSM Research Grant)","award":["meity\/r&d\/hpc\/2(1)\/2014"],"award-info":[{"award-number":["meity\/r&d\/hpc\/2(1)\/2014"]}]},{"DOI":"10.13039\/100004311","name":"Advanced Micro Devices","doi-asserted-by":"publisher","award":[""],"award-info":[{"award-number":[""]}],"id":[{"id":"10.13039\/100004311","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,2,17]]},"DOI":"10.1145\/3578360.3580273","type":"proceedings-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T20:20:06Z","timestamp":1676665206000},"page":"133-144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["RL4ReAl: Reinforcement Learning for Register Allocation"],"prefix":"10.1145","author":[{"given":"S.","family":"VenkataKeerthy","sequence":"first","affiliation":[{"name":"IIT Hyderabad, Hyderabad, India"}]},{"given":"Siddharth","family":"Jain","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, Hyderabad, India"}]},{"given":"Anilava","family":"Kundu","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, Hyderabad, India"}]},{"given":"Rohit","family":"Aggarwal","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, Hyderabad, India"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[{"name":"Google, France"}]},{"given":"Ramakrishna","family":"Upadrasta","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, Hyderabad, India"}]}],"member":"320","published-online":{"date-parts":[[2023,2,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Paul Almasan Jos\u00e9 Su\u00e1rez-Varela Arnau Badia-Sampera Krzysztof Rusek Pere Barlet-Ros and Albert Cabellos-Aparicio. 2020. Deep Reinforcement Learning meets Graph Neural Networks: exploring a routing optimization use case. arxiv:1910.07421."},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Machine Learning","author":"Alpaydin Ethem","year":"2012","unstructured":"Ethem Alpaydin. 2010. Introduction to Machine Learning (2nd ed.). The MIT Press. isbn:026201243X","edition":"2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378854"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3124452"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72521-3_20"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 32Nd International Conference on Neural Information Processing Systems (NIPS\u201918)","author":"Ben-Nun Tal","year":"2018","unstructured":"Tal Ben-Nun, Alice Shoshana Jakobovits, and Torsten Hoefler. 2018. Neural Code Comprehension: A Learnable Representation of Code Semantics. In Proceedings of the 32Nd International Conference on Neural Information Processing Systems (NIPS\u201918). Curran Associates Inc., USA. 3589\u20133601. http:\/\/dl.acm.org\/citation.cfm?id=3327144.3327276"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 26th International Conference on Neural Information Processing Systems -","volume":"2","author":"Bordes Antoine","year":"2013","unstructured":"Antoine Bordes, Nicolas Usunier, Alberto Garcia-Dur\u00e1n, Jason Weston, and Oksana Yakhnenko. 2013. Translating Embeddings for Modeling Multi-relational Data. In Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2 (NIPS\u201913). Curran Associates Inc., USA. 2787\u20132795. http:\/\/dl.acm.org\/citation.cfm?id=2999792.2999923"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Florent Bouchez Alain Darte Christophe Guillon and Fabrice Rastello. 2007. Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How. In Languages and Compilers for Parallel Computing George Alm\u00e1si C\u0103lin Ca\u015fcaval and Peng Wu (Eds.). Springer Berlin Heidelberg Berlin Heidelberg. 283\u2013298. isbn:978-3-540-72521-3 https:\/\/doi.org\/10.1007\/978-3-540-72521-3_21 10.1007\/978-3-540-72521-3_21","DOI":"10.1007\/978-3-540-72521-3_21"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177575"},{"key":"e_1_3_2_1_10_1","volume-title":"14th International Workshop on Logic and Synthesis.","author":"Brisk Philip","year":"2005","unstructured":"Philip Brisk, Foad Dabiri, Jamie Macbeth, and Majid Sarrafzadeh. 2005. Polynomial time graph coloring register allocation. In 14th International Workshop on Logic and Synthesis."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(81)90048-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(97)00184-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3168806"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/88616.88621"},{"key":"e_1_3_2_1_16_1","volume-title":"Community and LLVM Developers\u2019 conference. 2014","author":"LLVM","year":"2014","unstructured":"LLVM Community and LLVM Developers\u2019 conference. 2014. PBQP Register Allocation. https:\/\/llvm.org\/devmtg\/2014-10\/Slides\/PBQP-update-and-in-the-wild.pdf"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning, Marina Meila and Tong Zhang (Eds.) (Proceedings of Machine Learning Research","volume":"2253","author":"Cummins Chris","year":"2021","unstructured":"Chris Cummins, Zacharias V. Fisches, Tal Ben-Nun, Torsten Hoefler, Michael F P O\u2019Boyle, and Hugh Leather. 2021. ProGraML: A Graph-based Program Representation for Data Flow Analysis and Compiler Optimizations. In Proceedings of the 38th International Conference on Machine Learning, Marina Meila and Tong Zhang (Eds.) (Proceedings of Machine Learning Research, Vol. 139). PMLR, 2244\u20132253."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO53902.2022.9741258"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LLVMHPCHiPar51896.2020.00008"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-010-0161-2"},{"key":"e_1_3_2_1_22_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. isbn:0-7167-1044-7"},{"key":"e_1_3_2_1_23_1","volume-title":"d.]. gRPC Remote Procedure Calls. https:\/\/grpc.io [Online","author":"RPC.","year":"2022","unstructured":"gRPC. [n. d.]. gRPC Remote Procedure Calls. https:\/\/grpc.io [Online; accessed 29-Aug-2022]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11688839_20"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377928"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11860990_21"},{"key":"e_1_3_2_1_27_1","volume-title":"Mostofa Ali Patwary, and Gregory F. Diamos","author":"Huang Jiayi","year":"2019","unstructured":"Jiayi Huang, Md. Mostofa Ali Patwary, and Gregory F. Diamos. 2019. Coloring Big Graphs with AlphaGoZero. CoRR, abs\/1902.10162 (2019), arXiv:1902.10162. arxiv:1902.10162"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS55109.2022.00012"},{"key":"e_1_3_2_1_29_1","unstructured":"S O Jakob. 2011. Greedy Register Allocation in LLVM 3.0. http:\/\/blog.llvm.org\/2011\/09\/greedy-register-allocation-in-llvm-30.html"},{"key":"e_1_3_2_1_30_1","volume-title":"Qt-opt: Scalable deep reinforcement learning for vision-based robotic manipulation. arXiv preprint arXiv:1806.10293.","author":"Kalashnikov Dmitry","year":"2018","unstructured":"Dmitry Kalashnikov, Alex Irpan, Peter Pastor, Julian Ibarz, Alexander Herzog, Eric Jang, Deirdre Quillen, Ethan Holly, Mrinal Kalakrishnan, and Vincent Vanhoucke. 2018. Qt-opt: Scalable deep reinforcement learning for vision-based robotic manipulation. arXiv preprint arXiv:1806.10293."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3427378"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO53902.2022.9741272"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3054625"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/785411.785416"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_1_36_1","volume-title":"d.]. Performance Counters for Linux. https:\/\/perf.wiki.kernel.org\/index.php\/Main_Page [Online","year":"2022","unstructured":"Linux-Foundation. [n. d.]. Performance Counters for Linux. https:\/\/perf.wiki.kernel.org\/index.php\/Main_Page [Online; accessed 29-Aug-2022]"},{"key":"e_1_3_2_1_37_1","volume-title":"d.]. LLVM Machine Code Analyzer. https:\/\/llvm.org\/docs\/CommandGuide\/llvm-mca.html [Online","author":"LLVM.","year":"2022","unstructured":"LLVM. [n. d.]. LLVM Machine Code Analyzer. https:\/\/llvm.org\/docs\/CommandGuide\/llvm-mca.html [Online; accessed 29-Aug-2022]"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33558-7_54"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/LLVMHPCHiPar51896.2020.00006"},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning, Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.) (Proceedings of Machine Learning Research","volume":"4515","author":"Mendis Charith","year":"2019","unstructured":"Charith Mendis, Alex Renda, Dr.Saman Amarasinghe, and Michael Carbin. 2019. Ithemal: Accurate, Portable and Fast Basic Block Throughput Estimation using Deep Neural Networks. In Proceedings of the 36th International Conference on Machine Learning, Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.) (Proceedings of Machine Learning Research, Vol. 97). PMLR, 4505\u20134515. https:\/\/proceedings.mlr.press\/v97\/mendis19a.html"},{"key":"e_1_3_2_1_41_1","volume-title":"Advances in Neural Information Processing Systems, H. Wallach, H. Larochelle, A. Beygelzimer, F. d' Alch\u00e9-Buc","author":"Mendis Charith","year":"2019","unstructured":"Charith Mendis, Cambridge Yang, Yewen Pu, Dr.Saman Amarasinghe, and Michael Carbin. 2019. Compiler Auto-Vectorization with Imitation Learning. In Advances in Neural Information Processing Systems, H. Wallach, H. Larochelle, A. Beygelzimer, F. d' Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.). 32, Curran Associates, Inc.. https:\/\/proceedings.neurips.cc\/paper\/2019\/file\/d1d5923fc822531bbfd9d87d4760914b-Paper.pdf"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","unstructured":"Santosh G. Nagarakatte and R. Govindarajan. 2007. Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation. In Compiler Construction Shriram Krishnamurthi and Martin Odersky (Eds.). Springer Berlin Heidelberg Berlin Heidelberg. 126\u2013140. isbn:978-3-540-71229-9 https:\/\/doi.org\/10.1007\/978-3-540-71229-9_9 10.1007\/978-3-540-71229-9_9","DOI":"10.1007\/978-3-540-71229-9_9"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/330249.330250"},{"key":"e_1_3_2_1_44_1","unstructured":"Louis-No\u00ebl Pouchet and Tomofumi Yuki. 2018. PolyBench 4.2 Benchmarks. http:\/\/sourceforge.net\/projects\/polybench\/"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375609"},{"key":"e_1_3_2_1_46_1","unstructured":"John Schulman Filip Wolski Prafulla Dhariwal Alec Radford and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99372-6_3"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6495004"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428301"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2210.03894"},{"key":"e_1_3_2_1_52_1","volume-title":"MLGO: a Machine Learning Guided Compiler Optimizations Framework. CoRR, abs\/2101.04808","author":"Trofin Mircea","year":"2021","unstructured":"Mircea Trofin, Yundi Qian, Eugene Brevdo, Zinan Lin, Krzysztof Choromanski, and David Li. 2021. MLGO: a Machine Learning Guided Compiler Optimizations Framework. CoRR, abs\/2101.04808 (2021), arXiv:2101.04808. arxiv:2101.04808"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418463"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC.2012.29"}],"event":{"name":"CC '23: 32nd ACM SIGPLAN International Conference on Compiler Construction","location":"Montr\u00e9al QC Canada","acronym":"CC '23","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3578360.3580273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3578360.3580273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:52Z","timestamp":1750178812000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3578360.3580273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,17]]},"references-count":54,"alternative-id":["10.1145\/3578360.3580273","10.1145\/3578360"],"URL":"https:\/\/doi.org\/10.1145\/3578360.3580273","relation":{},"subject":[],"published":{"date-parts":[[2023,2,17]]},"assertion":[{"value":"2023-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}