{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:32:48Z","timestamp":1765546368988,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T00:00:00Z","timestamp":1539129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["LE 912\/15"],"award-info":[{"award-number":["LE 912\/15"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"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>Performance optimization of stencil codes requires data locality improvements. The polyhedron model for loop transformation is well suited for such optimizations with established techniques, such as the PLuTo algorithm and diamond tiling. However, in the domain of our project ExaStencils, stencil codes, it fails to yield optimal results. As an alternative, we propose a new, optimized, multi-dimensional polyhedral search space exploration and demonstrate its effectiveness: we obtain better results than existing approaches in several cases. We also propose how to specialize the search for the domain of stencil codes, which dramatically reduces the exploration effort without significantly impairing performance.<\/jats:p>","DOI":"10.1145\/3274653","type":"journal-article","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T13:30:46Z","timestamp":1539178246000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Polyhedral Search Space Exploration in the ExaStencils Code Generator"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1893-0508","authenticated-orcid":false,"given":"Stefan","family":"Kronawitter","sequence":"first","affiliation":[{"name":"University of Passau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[{"name":"University of Passau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688512"},{"issue":"4","key":"e_1_2_1_2_1","first-page":"3","article-title":"Compilers -- Principles, Techniques and Tools (2nd ed.). Addison-Wesley","volume":"6","author":"Aho A. V.","year":"2007","unstructured":"A. V. Aho , M. S. Lam , R. Sethi , and J. D. Ullman . 2007 . Compilers -- Principles, Techniques and Tools (2nd ed.). Addison-Wesley . Section 6 . 4 . 3 . A. V. Aho, M. S. Lam, R. Sethi, and J. D. Ullman. 2007. Compilers -- Principles, Techniques and Tools (2nd ed.). Addison-Wesley. Section 6.4.3.","journal-title":"Section"},{"volume-title":"SC 2012. IEEE Computer Society, Article 40","author":"Bandishti V.","key":"e_1_2_1_3_1","unstructured":"V. Bandishti , I. Pananilath , and U. Bondhugula . 2012. Tiling stencil computations to maximize parallelism . In SC 2012. IEEE Computer Society, Article 40 , 11 pages. V. Bandishti, I. Pananilath, and U. Bondhugula. 2012. Tiling stencil computations to maximize parallelism. In SC 2012. IEEE Computer Society, Article 40, 11 pages."},{"key":"e_1_2_1_4_1","unstructured":"C. Bastoul. 2014. Clan\u2014A Polyhedral Representation Extractor for High Level Programs. Available at the Clan Web site.  C. Bastoul. 2014. Clan\u2014A Polyhedral Representation Extractor for High Level Programs. Available at the Clan Web site."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2615094"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.70"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/070693199"},{"key":"e_1_2_1_10_1","volume-title":"PDPTA","author":"Dursun H.","year":"2009","unstructured":"H. Dursun , K. Nomura , W. Wang , M. Kunaseth , L. Peng , R. Seymour , R. K. Kalia , A. Nakano , and P. Vashishta . 2009. In-core optimization of high-order stencil computations . In PDPTA 2009 . CSREA Press, 533--538. H. Dursun, K. Nomura, W. Wang, M. Kunaseth, L. Peng, R. Seymour, R. K. Kalia, A. Nakano, and P. Vashishta. 2009. In-core optimization of high-order stencil computations. In PDPTA 2009. CSREA Press, 533--538."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"P. Feautrier and C. Lengauer. 2011. Polyhedron model. In Encyclopedia of Parallel Computing D. Padua et al. (Eds.). Springer 1581--1592.  P. Feautrier and C. Lengauer. 2011. Polyhedron model. In Encyclopedia of Parallel Computing D. Padua et al. (Eds.). Springer 1581--1592.","DOI":"10.1007\/978-0-387-09766-4_502"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088149.1088197"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109482"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/130935781"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11596110_2"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2581122.2544160"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807627"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"T.\n      Henretty K.\n      Stock L.-N.\n      Pouchet F.\n      Franchetti J.\n      Ramanujam and \n      P.\n      Sadayappan\n  . \n  2011\n  . Data layout transformation for stencil computations on short-vector SIMD architectures. In CC 2011 Lecture Notes in Computer Science Vol. \n  6601 J. Knoop (Ed.). \n  Springer 225--245.   T. Henretty K. Stock L.-N. Pouchet F. Franchetti J. Ramanujam and P. Sadayappan. 2011. Data layout transformation for stencil computations on short-vector SIMD architectures. In CC 2011 Lecture Notes in Computer Science Vol. 6601 J. Knoop (Ed.). Springer 225--245.","DOI":"10.1007\/978-3-642-19861-8_13"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2467268"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73588"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462187"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250761"},{"key":"e_1_2_1_26_1","volume-title":"Technical Report MIP-1502. Faculty of Computer Science and Mathematics","author":"Kronawitter S.","year":"2015","unstructured":"S. Kronawitter and C. Lengauer . 2015 . Optimizations Applied by the ExaStencils Code Generator . Technical Report MIP-1502. Faculty of Computer Science and Mathematics , University of Passau . 10 pages. S. Kronawitter and C. Lengauer. 2015. Optimizations Applied by the ExaStencils Code Generator. Technical Report MIP-1502. Faculty of Computer Science and Mathematics, University of Passau. 10 pages."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"C.\n      Lengauer S.\n      Apel M.\n      Bolten A.\n      Gr\u00f6\u00dflinger F.\n      Hannig H.\n      K\u00f6stler U.\n      R\u00fcde J.\n      Teich A.\n      Grebhahn S.\n      Kronawitter S.\n      Kuckuk H.\n      Rittich and \n      C.\n      Schmitt\n  . \n  2014\n  . ExaStencils: \n  Advanced\n   stencil-code engineering. In Euro-Par 2014: Parallel Processing Workshops Lecture Notes in Computer Science Vol. \n  8806 L. Lopes et al. (Eds.). \n  Springer 553--564.  C. Lengauer S. Apel M. Bolten A. Gr\u00f6\u00dflinger F. Hannig H. K\u00f6stler U. R\u00fcde J. Teich A. Grebhahn S. Kronawitter S. Kuckuk H. Rittich and C. Schmitt. 2014. ExaStencils: Advanced stencil-code engineering. In Euro-Par 2014: Parallel Processing Workshops Lecture Notes in Computer Science Vol. 8806 L. Lopes et al. (Eds.). Springer 553--564.","DOI":"10.1007\/978-3-319-14313-2_47"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02577874"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1006209.1006243"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775054.2694364"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.2"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645562.659704"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375594"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.21"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926449"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185528"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462176"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2830018.2830025"},{"key":"e_1_2_1_39_1","volume-title":"WOLFHPC","author":"Schmitt C.","year":"2014","unstructured":"C. Schmitt , S. Kuckuk , F. Hannig , H. K\u00f6stler , and J. Teich . 2014. ExaSlang: A domain-specific language for highly scalable multigrid solvers . In WOLFHPC 2014 . ACM, 42--51. C. Schmitt, S. Kuckuk, F. Hannig, H. K\u00f6stler, and J. Teich. 2014. ExaSlang: A domain-specific language for highly scalable multigrid solvers. In WOLFHPC 2014. ACM, 42--51."},{"volume-title":"Theory of Linear and Integer Programming","author":"Schrijver A.","key":"e_1_2_1_40_1","unstructured":"A. Schrijver . 1986. Theory of Linear and Integer Programming . Wiley . A. Schrijver. 1986. Theory of Linear and Integer Programming. Wiley."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989508"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2011.01.010"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888390.1888455"},{"key":"e_1_2_1_44_1","volume-title":"IMPACT 2012","author":"Verdoolaege S.","year":"2018","unstructured":"S. Verdoolaege and T. Grosser . 2012. Polyhedral extraction tool . In IMPACT 2012 . Retrieved on 1 Dec , 2018 from http:\/\/impact.gforge.inria.fr\/impact2012\/. S. Verdoolaege and T. Grosser. 2012. Polyhedral extraction tool. In IMPACT 2012. Retrieved on 1 Dec, 2018 from http:\/\/impact.gforge.inria.fr\/impact2012\/."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:56Z","timestamp":1750208276000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,10]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12,31]]}},"alternative-id":["10.1145\/3274653"],"URL":"https:\/\/doi.org\/10.1145\/3274653","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2018,10,10]]},"assertion":[{"value":"2018-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}