{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:26Z","timestamp":1750220186484,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2017-05029"],"award-info":[{"award-number":["RGPIN-2017-05029"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530610","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"1249-1254","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing parallel PREM compilation over nested loop structures"],"prefix":"10.1145","author":[{"given":"Zhao","family":"Gu","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada"}]},{"given":"Rodolfo","family":"Pellizzoni","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"M. Benabderrahmane L. Pouchet A. Cohen and C. Bastoul. 2010. The Polyhedral Model Is More Widely Applicable Than You Think. In Compiler Construction R. Gupta (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 283--303.","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024716.2024718"},{"key":"e_1_3_2_1_3_1","unstructured":"U. Bondhugula M. Baskaran S. Krishnamoorthy J. Ramanujam A. Rountev and P. Sadayappan. 2008. Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model. In International Conference on Compiler Construction (ETAPS CC). http:\/\/drona.csa.iisc.ernet.in\/~uday\/publications\/uday-cc08.pdf"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"P. Feautrier and C. Lengauer. 2011. The Polyhedron Model. In Encyclopedia of Parallel Computing David Padua (Ed.). Springer 1581--1592.","DOI":"10.1007\/978-0-387-09766-4_502"},{"volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE.","author":"Forsberg B.","key":"e_1_3_2_1_5_1","unstructured":"B. Forsberg, L. Benini, and A. Marongiu. 2018. HePREM: Enabling predictable GPU execution on heterogeneous SoC. In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE."},{"volume-title":"Proceedings of Languages, Compilers, Tools and Theory of Embedded Systems (LCTES'20)","author":"Forsberg B.","key":"e_1_3_2_1_6_1","unstructured":"B. Forsberg, M. Mattheeuws, A. Kurth, A. Marongiu, and L. Benini. 2020. A synergistic approach to predictable compilation and scheduling on commodity multi-cores. In Proceedings of Languages, Compilers, Tools and Theory of Embedded Systems (LCTES'20)."},{"volume-title":"Proceedings of the 9th International Workshop on Programming Models and Applications for Multicores and Manycores","author":"Mat\u011bjka J.","key":"e_1_3_2_1_7_1","unstructured":"J. Mat\u011bjka, B. Forsberg, M. Sojka, Z. Hanz\u00e1lek, L. Benini, and A. Marongiu. 2018. Combining PREM Compilation and ILP Scheduling for High-performance and Predictable MPSoC Execution. In Proceedings of the 9th International Workshop on Programming Models and Applications for Multicores and Manycores (Vienna, Austria) (PMAM'18). ACM, New York, NY, USA, 11--20."},{"volume-title":"Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS '11)","author":"Pellizzoni R.","key":"e_1_3_2_1_8_1","unstructured":"R. Pellizzoni, E. Betti, S. Bak, G. Yao, J. Criswell, M. Caccamo, and R. Kegley. 2011. A Predictable Execution Model for COTS-Based Embedded Systems. In Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS '11). IEEE Computer Society, Washington, DC, USA, 269--279."},{"key":"e_1_3_2_1_9_1","volume-title":"Implementation of Memory Centric Scheduling for COTS Multi-Core Real-Time Systems. In 31st Euromicro Conference on Real-Time Systems (ECRTS","volume":"133","author":"Rivas J.","year":"2019","unstructured":"J. Rivas, J. Goossens, X. Poczekajlo, and A. Paolillo. 2019. Implementation of Memory Centric Scheduling for COTS Multi-Core Real-Time Systems. In 31st Euromicro Conference on Real-Time Systems (ECRTS 2019), Vol. 133."},{"volume-title":"Proceedings of the 40th Real-Time Systems Symposium (RTSS'19)","author":"Soliman M.","key":"e_1_3_2_1_10_1","unstructured":"M. Soliman, G. Gracioli, R. Tabish, R. Pellizzoni, and M. Caccamo. 2019. Segment Streaming for the Three-Phase Execution Model: Design and Implementation. In Proceedings of the 40th Real-Time Systems Symposium (RTSS'19)."},{"volume-title":"2019 31th Euromicro Conference on Real-Time Systems (ECRTS). 1--23","author":"Soliman M. R.","key":"e_1_3_2_1_11_1","unstructured":"M. R. Soliman and R. Pellizzoni. 2019. PREM-based Optimal Task Segmentation under Fixed Priority Scheduling. In 2019 31th Euromicro Conference on Real-Time Systems (ECRTS). 1--23."},{"volume-title":"24th IEEE International Conference on High Performance Computing, Data, and Analytics, 2017. When Polyhedral Optimizations Meet Deep Learning Kernels.","author":"Vaidya H.","key":"e_1_3_2_1_12_1","unstructured":"H. Vaidya, A. Patwardhan, R. Upadrasta, and A. Badrinaaraayanan. 24th IEEE International Conference on High Performance Computing, Data, and Analytics, 2017. When Polyhedral Optimizations Meet Deep Learning Kernels."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"S. Verdoolaege and T. Grosser. 2012. Polyhedral Extraction Tool. 10.13140\/RG.2.1.4213.4562","DOI":"10.13140\/RG.2.1.4213.4562"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"S. Verdoolaege S. Guelton T. Grosser and A. Cohen. 2014. Schedule Trees. 10.13140\/RG.2.1.4475.6001","DOI":"10.13140\/RG.2.1.4475.6001"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"S. Verdoolaege and G. Janssens. 2017. Scheduling for PPCG. 10.13140\/RG.2.2.28998.68169","DOI":"10.13140\/RG.2.2.28998.68169"}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"San Francisco California","acronym":"DAC '22"},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530610","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:23Z","timestamp":1750186943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":16,"alternative-id":["10.1145\/3489517.3530610","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530610","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}