{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:14Z","timestamp":1750309454736,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"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\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1145\/3696443.3708951","type":"proceedings-article","created":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T11:50:26Z","timestamp":1740225026000},"page":"418-430","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Priori Loop Nest Normalization: Automatic Loop Scheduling in Complex Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0961-7723","authenticated-orcid":false,"given":"Lukas","family":"Tr\u00fcmper","sequence":"first","affiliation":[{"name":"Daisytuner, Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8429-7803","authenticated-orcid":false,"given":"Philipp","family":"Schaad","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0242-3640","authenticated-orcid":false,"given":"Berke","family":"Ates","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9095-9108","authenticated-orcid":false,"given":"Alexandru","family":"Calotoiu","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7606-5519","authenticated-orcid":false,"given":"Marcin","family":"Copik","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1333-9797","authenticated-orcid":false,"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2025,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858788.2688512"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306346.3322967"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of Machine Learning and Systems 2021","author":"Baghdadi Riyadh","year":"2021","unstructured":"Riyadh Baghdadi, Massinissa Merouani, Mohamed-Hicham Leghettas, Kamel Abdous, Taha Arbaoui, Karima Benatchba, and Saman P. Amarasinghe. 2021. A Deep Learning Based Cost Model for Automatic Code Optimization. In Proceedings of Machine Learning and Systems 2021, MLSys 2021, virtual, April 5-9, 2021, Alex Smola, Alex Dimakis, and Ion Stoica (Eds.). mlsys.org. https:\/\/proceedings.mlsys.org\/paper\/2021\/hash\/3def184ad8f4755ff269862ea77393dd-Abstract.html"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661197"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356173"},{"volume-title":"In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems. 617\u2013662","author":"Beyls Kristof","key":"e_1_3_2_1_6_1","unstructured":"Kristof Beyls and Erik H. D\u2019Hollander. 2001. Reuse Distance as a Metric for Cache Behavior. In In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems. 617\u2013662."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Uday Bondhugula Muthu Baskaran Sriram Krishnamoorthy J. Ramanujam Atanas Rountev and P. Sadayappan. 2008. Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model. In Compiler Construction Laurie Hendren (Ed.). Springer Berlin Heidelberg Berlin Heidelberg. 132\u2013146. isbn:978-3-540-78791-4","DOI":"10.1007\/978-3-540-78791-4_9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Uday Bondhugula Albert Hartono J. Ramanujam and P. Sadayappan. 2008. A Practical Automatic Polyhedral Parallelizer and Locality Optimizer. SIGPLAN Not. 43 6 (2008) jun 101\u2013113. issn:0362-1340 https:\/\/doi.org\/10.1145\/1379022.1375595 10.1145\/1379022.1375595","DOI":"10.1145\/1379022.1375595"},{"volume-title":"Languages and Compilers for Parallel Computing","author":"Callahan D.","key":"e_1_3_2_1_9_1","unstructured":"D. Callahan. 1992. Recognizing and parallelizing bounded recurrences. In Languages and Compilers for Parallel Computing, Utpal Banerjee, David Gelernter, Alex Nicolau, and David Padua (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 169\u2013185. isbn:978-3-540-47063-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524059.3532389"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3410463.3414635"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372266"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 13th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201918)","author":"Chen Tianqi","year":"2018","unstructured":"Tianqi Chen, Thierry Moreau, Ziheng Jiang, Lianmin Zheng, Eddie Yan, Meghan Cowan, Haichen Shen, Leyuan Wang, Yuwei Hu, Luis Ceze, Carlos Guestrin, and Arvind Krishnamurthy. 2018. TVM: An Automated End-to-End Optimizing Compiler for Deep Learning. In Proceedings of the 13th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201918). USENIX Association, USA. 579\u2013594. isbn:9781931971478"},{"key":"e_1_3_2_1_14_1","unstructured":"Edward Grady Coffman and Peter J Denning. 1973. Operating systems theory. 973 prentice-Hall Englewood Cliffs NJ."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459010"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377555.3377893"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743016"},{"key":"e_1_3_2_1_18_1","volume-title":"IPACT 2011 ; Conference date: 03-04-2011 Through 03-04-2011","author":"Grosser Tobias","year":"2011","unstructured":"Tobias Grosser, Hongbin Zheng, Raghesh Aloor, Andreas Simb\u00fcrger, Armin Gr\u00f6\u00df linger, and Louis-No\u00ebl Pouchet. 2011. Polly - Polyhedral optimization in LLVM. http:\/\/impact2011.inrialpes.fr\/en\/index.html First International Workshop on Polyhedral Compilation Techniques, IPACT 2011 ; Conference date: 03-04-2011 Through 03-04-2011"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-2649-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807644"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/773473.178258"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314653"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833157.2833162"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/305138.305197"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555250"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3578360.3580257"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.3390\/math9141685"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177494"},{"key":"e_1_3_2_1_29_1","unstructured":"Louis-No\u00ebl Pouchet and Tomofumi Yuki. 2017. PolyBench: The polyhedral benchmark suite (version 4.2)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3571885.3571970"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520312.3534863"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of Machine Learning and Systems, A. Smola, A. Dimakis, and I. Stoica (Eds.). 3, 323\u2013334","author":"Steiner Benoit","year":"2021","unstructured":"Benoit Steiner, Chris Cummins, Horace He, and Hugh Leather. 2021. Value Learning for Throughput Optimization of Deep Learning Workloads. In Proceedings of Machine Learning and Systems, A. Smola, A. Dimakis, and I. Stoica (Eds.). 3, 323\u2013334. https:\/\/proceedings.mlsys.org\/paper\/2021\/file\/73278a4a86960eeb576a8fd4c9ec6997-Paper.pdf"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3577193.3593714"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2703149"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15582-6_49"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460360"}],"event":{"name":"CGO '25: 23rd ACM\/IEEE International Symposium on Code Generation and Optimization","sponsor":["SIGPLAN SIGPLAN Programming Languages","SIGMICRO SIGMICRO Microarchitecture","IEEE Computer Society IEEE Computer Society"],"location":"Las Vegas NV USA","acronym":"CGO '25"},"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.3708951","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.3708951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":36,"alternative-id":["10.1145\/3696443.3708951","10.1145\/3696443"],"URL":"https:\/\/doi.org\/10.1145\/3696443.3708951","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"}}]}}