{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:43:37Z","timestamp":1780994617054,"version":"3.54.1"},"reference-count":162,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["470527619"],"award-info":[{"award-number":["470527619"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"crossref","award":["CCF-2107556"],"award-info":[{"award-number":["CCF-2107556"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100009708","name":"Novo Nordisk Foundation","doi-asserted-by":"crossref","award":["NNF24OC0090447"],"award-info":[{"award-number":["NNF24OC0090447"]}],"id":[{"id":"10.13039\/501100009708","id-type":"DOI","asserted-by":"crossref"}]},{"name":"SFI-CGF through Research Council of Norway","award":["309960"],"award-info":[{"award-number":["309960"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>\n            Scheduling languages express to a compiler\u2014or equivalently, a code generator\u2014a sequence of optimizations to apply. Performance tools that support a scheduling language interface allow exploration of optimizations,\n            <jats:italic toggle=\"yes\">i.e., exploratory compilers<\/jats:italic>\n            . While scheduling languages have become a common feature of tools for experts, the proliferation of these languages without unifying common features may be confusing to users. Moreover, we recognize a need to organize the compiler developer community around common exploratory compiler infrastructure, and future advances to address, for example, data layout and data movement. To support a broader set of users may require raising the level of abstraction. This article provides a chronology of scheduling languages, discussing their origins in iterative compilation and autotuning, noting the common features that are used in existing frameworks, and calling for changes to increase their utility and portability.\n          <\/jats:p>","DOI":"10.1145\/3743135","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T01:46:08Z","timestamp":1749779168000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling Language Chronology: Past, Present, and Future"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3058-7573","authenticated-orcid":false,"given":"Mary","family":"Hall","sequence":"first","affiliation":[{"name":"University of Utah","place":["United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5421-6876","authenticated-orcid":false,"given":"Cosmin E.","family":"Oancea","sequence":"additional","affiliation":[{"name":"University of Copenhagen","place":["Denmark"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7087-6193","authenticated-orcid":false,"given":"Anne C.","family":"Elster","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology","place":["Norway"]},{"name":"Univ. of Texas at Austin","place":["Norway"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0286-0755","authenticated-orcid":false,"given":"Ari","family":"Rasch","sequence":"additional","affiliation":[{"name":"University of Muenster","place":["Germany"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0345-4235","authenticated-orcid":false,"given":"Sameeran","family":"Joshi","sequence":"additional","affiliation":[{"name":"University of Utah","place":["United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2990-1496","authenticated-orcid":false,"given":"Amir Mohammad","family":"Tavakkoli","sequence":"additional","affiliation":[{"name":"University of Utah","place":["United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7592-6850","authenticated-orcid":false,"given":"Richard","family":"Schulze","sequence":"additional","affiliation":[{"name":"University of Muenster","place":["Germany"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,9,19]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.5555\/646662.699219"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460369"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3306346.3322967"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523442"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579990.3580020"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485486"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542481"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628092"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3197978"},{"key":"e_1_3_3_11_2","unstructured":"I. Bachiri H. Benmeziane S. Niar R. Baghdadi H. Ouarnoughi and A. Aries. 2024. Combining neural architecture search and automatic code optimization: A survey."},{"key":"e_1_3_3_12_2","unstructured":"R. Baghdadi M. Merouani M.-H. Leghettas K. Abdous T. Arbaoui K. Benatchba and S. Amarasinghe. 2021. A deep learning based cost model for automatic code optimization. In Procs. of Machine Learning and Systems. 181\u2013193."},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661197"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2841200"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3591236"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345210"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840311"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356173"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00078"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3544559"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/263580.263662"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.42122"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/91254"},{"key":"e_1_3_3_24_2","volume-title":"Work. on Prof. Feedb.-dir. Compil","author":"Bodin F.","year":"1998","unstructured":"F. Bodin, T. Kisuki, P. Knijnenburg, M. O\u2019Boyle, and E. Rohou. 1998. Iterative compilation in a non-linear optimisation space. In Work. on Prof. Feedb.-dir. Compil."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","unstructured":"J. M. Boyle T. J. Harmer and V. L. Winter. 1997. The TAMPR program transformation system: Simplifying the development of numerical software. In Modern Software Tools for Scientific Computing Birkhauser Boston Inc. 353\u2013372.","DOI":"10.1007\/978-1-4612-1986-6_17"},{"key":"e_1_3_3_27_2","volume-title":"Procs. Symp. on Implem. and Applic. of Funct. Lang. (IFL)","author":"Bruun L. M.","year":"2024","unstructured":"L. M. Bruun, U. S. Larsen, N. H. Hinnerskov, and C. E. Oancea. 2024. Reverse-mode AD of multi-reduce and scan in Futhark. In Procs. Symp. on Implem. and Applic. of Funct. Lang. (IFL). ACM."},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2093157.2093165"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1103845.1094852"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3410463.3414635"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3372266"},{"key":"e_1_3_3_32_2","unstructured":"C. Chen J. Chame and M. W. Hall. 2008. CHiLL: A framework for composing high-level loop transformations. University of Southern California."},{"key":"e_1_3_3_33_2","first-page":"579","volume-title":"Conf. on Op. Sys. Design and Implem. (OSDI)","author":"Chen T.","year":"2018","unstructured":"T. Chen, T. Moreau, Z. Jiang, L. Zheng, E. Yan, M. Cowan, H. Shen, L. Wang, Y. Hu, L. Ceze, et\u00a0al. 2018. TVM: An automated end-to-end optimizing compiler for deep learning. In Conf. on Op. Sys. Design and Implem. (OSDI). 579\u2013594."},{"key":"e_1_3_3_34_2","unstructured":"Tianqi Chen Lianmin Zheng Eddie Yan Ziheng Jiang Thierry Moreau Luis Ceze Carlos Guestrin and Arvind Krishnamurthy. 2018. Learning to optimize tensor programs. In Proceedings of the 32nd International Conference on Neural Information Processing Systems (NIPS\u201918) Curran Associates Inc. Montr\u00e9al Canada 3393\u20133404."},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276493"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2967938.2967969"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/4434.656771"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00087-9"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512551"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.24"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/10704973_3"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.5555\/184716.184730"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301670"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69330-7_10"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1989.266624"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161105"},{"key":"e_1_3_3_47_2","volume-title":"Efficient Processing of Distributed Acoustic Sensing Data: Anomaly Detection Using Autoencoders","author":"Fagervik J. A.","year":"2024","unstructured":"J. A. Fagervik. 2024. Efficient Processing of Distributed Acoustic Sensing Data: Anomaly Detection Using Autoencoders. Master\u2019s thesis. Norwegian University of Science and Technology."},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.85"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4029"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4384"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2006.55"},{"key":"e_1_3_3_52_2","first-page":"38","volume-title":"Machine Learning and Systems","author":"Fegade P.","year":"2021","unstructured":"P. Fegade, T. Chen, P. Gibbons, and T. Mowry. 2021. Cortex: A compiler for recursive deep learning models. In Machine Learning and Systems, A. Smola, A. Dimakis, and I. Stoica (Eds.). Vol. 3. 38\u201354. https:\/\/proceedings.mlsys.org\/paper_files\/paper\/2021\/hash\/eca986d585a03890a412587a2f5ccb43-Abstract.html"},{"key":"e_1_3_3_53_2","first-page":"721","volume-title":"Machine Learning and Systems","author":"Fegade P.","year":"2022","unstructured":"P. Fegade, T. Chen, P. Gibbons, and T. Mowry. 2022. The CoRa tensor compiler: Compilation for ragged tensors with minimal padding. In Machine Learning and Systems, D. Marculescu, Y. Chi, and C. Wu (Eds.). Vol. 4. 721\u2013747."},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301661"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/325478.325479"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00040"},{"key":"e_1_3_3_57_2","doi-asserted-by":"crossref","DOI":"10.1007\/s10766-006-0012-3","article-title":"Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies","volume":"34","author":"Girbal S.","year":"2006","unstructured":"S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. 2006. Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies. Int. J. of Parallel Program. 34, 3 (2006), 35\u201344.","journal-title":"Int. J. of Parallel Program."},{"key":"e_1_3_3_58_2","volume-title":"10th USENIX USENIX Symp. on Operating Sys. Design and Impl. (OSDI 12)","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. 2012. PowerGraph: Distributed graph-parallel computation on natural graphs. In 10th USENIX USENIX Symp. on Operating Sys. Design and Impl. (OSDI 12)."},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/2751205.2751223"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2019.00036"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3410463.3414632"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582018"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3408974"},{"key":"e_1_3_3_64_2","volume-title":"Int. Symp. on Code Gen. and Optim. (CGO)","author":"Hagedorn B.","year":"2018","unstructured":"B. Hagedorn, L. Stoltzfus, M. Steuwer, S. Gorlatch, and C. Dubach. 2018. High performance stencil code generation with lift. In Int. Symp. on Code Gen. and Optim. (CGO)."},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377928"},{"key":"e_1_3_3_66_2","unstructured":"A. Haj-Ali H. Genc Q. Huang W. Moses J. Wawrzynek K. Asanovi? and I. Stoica. 2020. ProTuner: Tuning programs with monte carlo tree search."},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13374-9_4"},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161004"},{"key":"e_1_3_3_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295707"},{"key":"e_1_3_3_70_2","first-page":"186","volume-title":"IEEE Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)","author":"Huff D.","year":"2021","unstructured":"D. Huff, S. Dai, and P. Hanrahan. 2021. Clockwork: Resource-efficient static scheduling for multi-rate image processing applications on FPGAs. In IEEE Int. Symp. on Field-Programmable Custom Computing Machines (FCCM). 186\u2013194."},{"key":"e_1_3_3_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523446"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041296"},{"key":"e_1_3_3_73_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO57630.2024.10444795"},{"key":"e_1_3_3_74_2","volume-title":"NIK 2011","author":"Jensen R.","year":"2011","unstructured":"R. Jensen, I. Karlin, and A. C. Elster. 2011. Autotuning a matrix routine for high performance. In NIK 2011."},{"key":"e_1_3_3_75_2","first-page":"203","volume-title":"Haskell Workshop","author":"Jones S. P.","year":"2001","unstructured":"S. P. Jones, A. Tolmach, and T. Hoare. 2001. Playing by the rules: Rewriting as a practical optimisation technique in GHC. In Haskell Workshop, Vol. 1. 203\u2013233."},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.106"},{"issue":"4","key":"e_1_3_3_77_2","first-page":"31","article-title":"A script-based autotuning compiler system to generate high-performance CUDA code","volume":"9","author":"Khan M.","year":"2013","unstructured":"M. Khan, P. Basu, G. Rudy, M. Hall, C. Chen, and J. Chame. 2013. A script-based autotuning compiler system to generate high-performance CUDA code. ACM Trans. Archit. Code Optim. (TACO) 9, 4, Article 31 (2013), 25 pages.","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"key":"e_1_3_3_78_2","doi-asserted-by":"publisher","DOI":"10.5555\/3133690"},{"key":"e_1_3_3_79_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2000.888348"},{"key":"e_1_3_3_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133901"},{"key":"e_1_3_3_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/3632900"},{"key":"e_1_3_3_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314653"},{"key":"e_1_3_3_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_3_84_2","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384628"},{"key":"e_1_3_3_85_2","volume-title":"10th USENIX Symp. on Operating Sys. Design and Impl. (OSDI 12)","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola, G. Blelloch, and C. Guestrin. 2012. GraphChi: Large-scale graph computation on just a PC. In 10th USENIX Symp. on Operating Sys. Design and Impl. (OSDI 12)."},{"key":"e_1_3_3_86_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"e_1_3_3_87_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2015.229"},{"key":"e_1_3_3_88_2","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201383"},{"key":"e_1_3_3_89_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51364-7_4"},{"key":"e_1_3_3_90_2","doi-asserted-by":"crossref","unstructured":"M. P. L\u00fccke O. Zinenko W. S. Moses M. Steuwer and A. Cohen. 2025. The MLIR transform dialect: Your compiler is more powerful than you think. In Procs. of Int. Symp. on Code Generation and Optimization (CGO\u201925). ACM 241\u2013254.","DOI":"10.1145\/3696443.3708922"},{"key":"e_1_3_3_91_2","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892210"},{"key":"e_1_3_3_92_2","unstructured":"M. Merouani K. A. Boudaoud I. N. Aouadj N. Tchoulak I. K. Bernou H. Benyamina F. Benbouzid-Si Tayeb K. Benatchba H. Leather and R. Baghdadi. 2024. LOOPer: A learned automatic code optimizer for polyhedral compilers."},{"key":"e_1_3_3_93_2","volume-title":"High Perf. Extreme Comp. (HPEC)","author":"Moura J. M. F.","year":"2001","unstructured":"J. M. F. Moura, J. Johnson, R. W. Johnson, D. Padua, V. K. Prasanna, M. P\u00fcschel, B. Singer, M. Veloso, and J. Xiong. 2001. Generating platform-adapted DSP libraries using SPIRAL. In High Perf. Extreme Comp. (HPEC)."},{"key":"e_1_3_3_94_2","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694364"},{"key":"e_1_3_3_95_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925952"},{"key":"e_1_3_3_96_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-83978-9_1"},{"key":"e_1_3_3_97_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00036"},{"key":"e_1_3_3_98_2","doi-asserted-by":"publisher","DOI":"10.1145\/2450136.2450138"},{"key":"e_1_3_3_99_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3462213"},{"key":"e_1_3_3_100_2","doi-asserted-by":"crossref","unstructured":"N. Nayak T. O. Odemuyiwa S. Ugare C. Fletcher M. Pellauer and J. Emer. 2023. TeAAL: A declarative framework for modeling sparse tensor accelerators. In Procs. of IEEE\/ACM Int. Symposium on Microarchitecture (MICRO\u201923). 1255\u20131270.","DOI":"10.1145\/3613424.3623791"},{"key":"e_1_3_3_101_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.106"},{"key":"e_1_3_3_102_2","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_3_103_2","doi-asserted-by":"publisher","DOI":"10.1145\/3204919.3204924"},{"key":"e_1_3_3_104_2","doi-asserted-by":"publisher","DOI":"10.1145\/2038698.2038711"},{"key":"e_1_3_3_105_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460945.3464955"},{"key":"e_1_3_3_106_2","doi-asserted-by":"publisher","DOI":"10.1145\/3578360.3580272"},{"key":"e_1_3_3_107_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_3_108_2","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375594"},{"key":"e_1_3_3_109_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840306"},{"key":"e_1_3_3_110_2","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462176"},{"key":"e_1_3_3_111_2","doi-asserted-by":"publisher","DOI":"10.1145\/3665643"},{"key":"e_1_3_3_112_2","doi-asserted-by":"publisher","DOI":"10.1145\/3297280.3297330"},{"key":"e_1_3_3_113_2","doi-asserted-by":"publisher","DOI":"10.1145\/3578360.3580269"},{"key":"e_1_3_3_114_2","doi-asserted-by":"publisher","DOI":"10.1145\/3427093"},{"key":"e_1_3_3_115_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.30"},{"key":"e_1_3_3_116_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2862896"},{"key":"e_1_3_3_117_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00073"},{"key":"e_1_3_3_118_2","doi-asserted-by":"publisher","DOI":"10.1145\/2597652.2597673"},{"issue":"4","key":"e_1_3_3_119_2","article-title":"Loop tiling in large-scale stencil codes at run-time with OPS","volume":"29","author":"Reguly I. Z.","year":"2018","unstructured":"I. Z. Reguly, G. R. Mudalige, and M. B. Giles. 2018. Loop tiling in large-scale stencil codes at run-time with OPS. IEEE Trans. on Par. and Distr. Sys. 29, 4 (2018), 873\u2013886.","journal-title":"IEEE Trans. on Par. and Distr. Sys."},{"key":"e_1_3_3_120_2","doi-asserted-by":"publisher","DOI":"10.1145\/2884045.2884046"},{"key":"e_1_3_3_121_2","volume-title":"ImageCL 3D Extensions Targeting Adative Mesh Refinement Proxy Applications on GPUs","author":"Rogstadkj\u00e6rnet Even Olsson","year":"2018","unstructured":"Even Olsson Rogstadkj\u00e6rnet. 2018. ImageCL 3D Extensions Targeting Adative Mesh Refinement Proxy Applications on GPUs. Master\u2019s thesis. Norwegian University of Science and Technology."},{"key":"e_1_3_3_122_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41404.2022.00063"},{"key":"e_1_3_3_123_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428226"},{"key":"e_1_3_3_124_2","first-page":"3","volume-title":"Lang. and Comp. for Par. Comp. (LCPC)","author":"Shirako J.","year":"2020","unstructured":"J. Shirako and V. Sarkar. 2020. An affine scheduling framework for integrating data layout and loop transformations. In Lang. and Comp. for Par. Comp. (LCPC). 3\u201319."},{"key":"e_1_3_3_125_2","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"issue":"3","key":"e_1_3_3_126_2","first-page":"23","article-title":"Schedule synthesis for halide pipelines on GPUs","volume":"17","author":"Sioutas S.","year":"2020","unstructured":"S. Sioutas, S. Stuijk, T. Basten, H. Corporaal, and L. Somers. 2020. Schedule synthesis for halide pipelines on GPUs. ACM Trans. Archit. Code Optim. (TACO) 17, 3, Article 23 (Aug2020), 25 pages.","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"issue":"2","key":"e_1_3_3_127_2","first-page":"10","article-title":"Schedule synthesis for halide pipelines through reuse analysis","volume":"16","author":"Sioutas S.","year":"2019","unstructured":"S. Sioutas, S. Stuijk, L. Waeijen, T. Basten, H. Corporaal, and L. Somers. 2019. Schedule synthesis for halide pipelines through reuse analysis. ACM Trans. Archit. Code Optim. (TACO) 16, 2, Article 10 (Apr2019), 22 pages.","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"key":"e_1_3_3_128_2","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784754"},{"key":"e_1_3_3_129_2","unstructured":"M. Steuwer T. Koehler B. K\u00f6pcke and F. Pizzuti. 2022. RISE & Shine: Language-Oriented Compiler Design."},{"key":"e_1_3_3_130_2","volume-title":"An Introduction to Computational Networks and the Computational Network Toolkit","author":"Strandh R.","year":"1998","unstructured":"R. Strandh and A. C. Elster. 1998. An Introduction to Computational Networks and the Computational Network Toolkit. Technical Report CNA-288."},{"key":"e_1_3_3_131_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2857721"},{"key":"e_1_3_3_132_2","doi-asserted-by":"publisher","DOI":"10.1145\/1065895.1065899"},{"key":"e_1_3_3_133_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.02.004"},{"key":"e_1_3_3_134_2","doi-asserted-by":"crossref","unstructured":"Q. Sun Y. Liu H. Yang Z. Jiang Z. Luan and D. Qian. 2024. Adaptive auto-tuning framework for global exploration of stencil optimization on GPUs. IEEE Transactions on Parallel and Distributed Systems 35 1 (2024) 20\u201333.","DOI":"10.1109\/TPDS.2023.3325630"},{"key":"e_1_3_3_135_2","volume-title":"Int. Workshop on Lang. and Comp. for Par. Comp. (LCPC)","author":"Tavakkoli A. M.","year":"2023","unstructured":"A. M. Tavakkoli, S. Joshi, S. Singh, Y Xu, P. Sadayappan, and M. Hall. 2023. PEAK: Generating high-performance schedules in MLIR. In Int. Workshop on Lang. and Comp. for Par. Comp. (LCPC). Springer Verlag."},{"key":"e_1_3_3_136_2","doi-asserted-by":"publisher","DOI":"10.1145\/183018.183047"},{"key":"e_1_3_3_137_2","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169762"},{"key":"e_1_3_3_138_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661203"},{"key":"e_1_3_3_139_2","doi-asserted-by":"publisher","DOI":"10.1145\/3315508.3329973"},{"key":"e_1_3_3_140_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161054"},{"key":"e_1_3_3_141_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2003.1191546"},{"key":"e_1_3_3_142_2","doi-asserted-by":"publisher","DOI":"10.1145\/3577193.3593714"},{"key":"e_1_3_3_143_2","unstructured":"N. Vasilache O. Zinenko T. Theodoridis P. Goyal Z. DeVito W. S. Moses S. Verdoolaege A. Adams and A. Cohen. 2018. Tensor comprehensions: framework-agnostic high-performance machine learning abstractions."},{"key":"e_1_3_3_144_2","doi-asserted-by":"publisher","DOI":"10.1145\/3355606"},{"key":"e_1_3_3_145_2","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738003"},{"key":"e_1_3_3_146_2","doi-asserted-by":"publisher","DOI":"10.5555\/3014904.3014959"},{"key":"e_1_3_3_147_2","doi-asserted-by":"publisher","DOI":"10.1177\/1094342019866247"},{"key":"e_1_3_3_148_2","volume-title":"IEEE\/ACM Int. Symp. on Code Gen. and Opt. (CGO)","author":"Venkat A.","year":"2014","unstructured":"A. Venkat, M. Shantharam, M. Hall, and M. Strout. 2014. Non-affine extensions to polyhedral code generation. In IEEE\/ACM Int. Symp. on Code Gen. and Opt. (CGO)."},{"issue":"4","key":"e_1_3_3_149_2","first-page":"54:1\u201354:23","article-title":"Polyhedral parallel code generation for CUDA","volume":"9","author":"Verdoolaege S.","year":"2013","unstructured":"S. Verdoolaege, J. Carlos Juega, A. Cohen, J. Ignacio G\u00f3mez, C. Tenllado, and F. Catthoor. 2013. Polyhedral parallel code generation for CUDA. ACM Trans. Archit. Code Optim. (TACO) 9, 4 (2013), 54:1\u201354:23.","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"key":"e_1_3_3_150_2","article-title":"Scheduling for PPCG","volume":"706","author":"Verdoolaege S.","year":"2017","unstructured":"S. Verdoolaege and G. Janssens. 2017. Scheduling for PPCG. Report CW 706 (2017).","journal-title":"Report CW"},{"key":"e_1_3_3_151_2","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289425"},{"key":"e_1_3_3_152_2","doi-asserted-by":"publisher","DOI":"10.1145\/3106343"},{"key":"e_1_3_3_153_2","doi-asserted-by":"publisher","DOI":"10.5555\/1023242"},{"key":"e_1_3_3_154_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.1998.10004"},{"key":"e_1_3_3_155_2","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113449"},{"key":"e_1_3_3_156_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575742"},{"key":"e_1_3_3_157_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523437"},{"key":"e_1_3_3_158_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370637"},{"key":"e_1_3_3_159_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276491"},{"key":"e_1_3_3_160_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356210"},{"key":"e_1_3_3_161_2","doi-asserted-by":"publisher","DOI":"10.1145\/3566054"},{"key":"e_1_3_3_162_2","first-page":"863","volume-title":"USENIX Symp. on Op. Sys. Design and Impl. (OSDI)","author":"Zheng L.","year":"2020","unstructured":"L. Zheng, C. Jia, M. Sun, Z. Wu, C. Hao Yu, A. Haj-Ali, Y. Wang, J. Yang, D. Zhuo, K. Sen, et\u00a0al. 2020. Ansor: Generating high-performance tensor programs for deep learning. In USENIX Symp. on Op. Sys. Design and Impl. (OSDI). 863\u2013879."},{"key":"e_1_3_3_163_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378508"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3743135","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3743135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T00:48:40Z","timestamp":1758329320000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3743135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,19]]},"references-count":162,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3743135"],"URL":"https:\/\/doi.org\/10.1145\/3743135","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,19]]},"assertion":[{"value":"2024-11-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}