{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:53Z","timestamp":1750221113093,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"CREST, Japan Science and Technology Agency, JSPS KAKENHI","award":["17K12658"],"award-info":[{"award-number":["17K12658"]}]},{"name":"JST PRESTO","award":["JPMJPR18M6"],"award-info":[{"award-number":["JPMJPR18M6"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2018,12,31]]},"abstract":"<jats:p>On modern many-core CPUs, performance tuning against complex memory subsystems and scalability for parallelism is mandatory to achieve their potential. In this article, we focus on loop tiling, which plays an important role in performance tuning, and develop a novel framework that analytically models the load balance and empirically autotunes unpredictable cache behaviors through iterative polyhedral compilation using LLVM\/Polly. From an evaluation on many-core CPUs, we demonstrate that our autotuner achieves a performance superior to those that use conventional static approaches and well-known autotuning heuristics. Moreover, our autotuner achieves almost the same performance as a brute-force search-based approach.<\/jats:p>","DOI":"10.1145\/3293449","type":"journal-article","created":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T15:53:12Z","timestamp":1546962792000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["An Autotuning Framework for Scalable Execution of Tiled Code via Iterative Polyhedral Compilation"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3491-1692","authenticated-orcid":false,"given":"Yukinori","family":"Sato","sequence":"first","affiliation":[{"name":"Toyohashi University of Technology, Tempaku-cho, Toyohashi, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoya","family":"Yuki","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshio","family":"Endo","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2006.37"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628092"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158120"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451141"},{"volume-title":"A Performance Prediction Function Based on the Exploration of a Schedule Search Space in the Polyhedron Model. Master\u2019s thesis","author":"Danner Dominik Karl","key":"e_1_2_1_7_1","unstructured":"Dominik Karl Danner . 2017. A Performance Prediction Function Based on the Exploration of a Schedule Search Space in the Polyhedron Model. Master\u2019s thesis . University of Passau . Dominik Karl Danner. 2017. A Performance Prediction Function Based on the Exploration of a Schedule Search Space in the Polyhedron Model. Master\u2019s thesis. University of Passau."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178372.3179529"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109482"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2581122.2544160"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626412500107"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13374-9_4"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161004"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908123"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3195638.3195666"},{"key":"e_1_2_1_17_1","volume-title":"Allen","author":"Kennedy Ken","year":"2002","unstructured":"Ken Kennedy and John R . Allen . 2002 . Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers Inc . Ken Kennedy and John R. Allen. 2002. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers Inc."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/517554.825767"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1064450.1064458"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.06.005"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926288"},{"key":"e_1_2_1_22_1","unstructured":"Orio. 2008. Retrieved from http:\/\/brnorris03.github.io\/Orio\/.  Orio. 2008. Retrieved from http:\/\/brnorris03.github.io\/Orio\/."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926449"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018744"},{"key":"e_1_2_1_25_1","volume-title":"Rajopadhye","author":"Ranasinghe Waruna","year":"2018","unstructured":"Waruna Ranasinghe , Nirmal Prajapati , Tomofumi Yuki , and Sanjay V . Rajopadhye . 2018 . PCOT : Cache oblivious tiling of polyhedral programs. arXiv preprint arXiv:1802.00166 (2018). Waruna Ranasinghe, Nirmal Prajapati, Tomofumi Yuki, and Sanjay V. Rajopadhye. 2018. PCOT: Cache oblivious tiling of polyhedral programs. arXiv preprint arXiv:1802.00166 (2018)."},{"key":"e_1_2_1_26_1","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell Stuart","year":"2009","unstructured":"Stuart Russell and Peter Norvig . 2009 . Artificial Intelligence: A Modern Approach ( 3 rd ed.). Prentice Hall Press . Stuart Russell and Peter Norvig. 2009. Artificial Intelligence: A Modern Approach (3rd ed.). Prentice Hall Press.","edition":"3"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742910"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64203-1_9"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3075564.3077627"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28652-0_6"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2011.6152742"},{"volume-title":"Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques (IMPACT\u201913)","author":"Wonnacott D. G.","key":"e_1_2_1_32_1","unstructured":"D. G. Wonnacott and M. M. Strout . 2013. On the scalability of loop tiling techniques . In Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques (IMPACT\u201913) . D. G. Wonnacott and M. M. Strout. 2013. On the scalability of loop tiling techniques. In Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques (IMPACT\u201913)."},{"key":"e_1_2_1_33_1","unstructured":"Tomofumi Yuki and Louis-No\u00ebl Pouchet. 2016. PolyBench 4.2 Document. Retrieved from https:\/\/sourceforge.net\/projects\/polybench\/.  Tomofumi Yuki and Louis-No\u00ebl Pouchet. 2016. PolyBench 4.2 Document. Retrieved from https:\/\/sourceforge.net\/projects\/polybench\/."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772982"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:01Z","timestamp":1750208521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12,31]]}},"alternative-id":["10.1145\/3293449"],"URL":"https:\/\/doi.org\/10.1145\/3293449","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"2018-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}