{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:55Z","timestamp":1750220935613,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["299215159"],"award-info":[{"award-number":["299215159"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,26]]},"DOI":"10.1145\/3330345.3330377","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"354-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficient hierarchical online-autotuning"],"prefix":"10.1145","author":[{"given":"Philip","family":"Pfaffe","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology"}]},{"given":"Tobias","family":"Grosser","sequence":"additional","affiliation":[{"name":"ETH Zurich"}]},{"given":"Martin","family":"Tillmann","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542481"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628092"},{"volume-title":"Active-Learning-Based Surrogate Models for Empirical Performance Tuning. In 2013 IEEE International Conference on Cluster Computing (CLUSTER).","author":"Balaprakash Prasanna","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158120"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Alexander Barvinok. 2008. Integer Points in Polyhedra. European Mathematical Society.  Alexander Barvinok. 2008. Integer Points in Polyhedra. European Mathematical Society.","DOI":"10.4171\/052"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_14"},{"volume-title":"Innovative Parallel Computing (InPar)","author":"Bergstra James","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the IASTED Conference on Parallel and Distributed Computing and systems","volume":"14","author":"Beyls Kristof","year":"2001"},{"volume-title":"Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation (PLDI 08)","author":"Bondhugula Uday","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.32"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/305138.305245"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378859"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2005.10"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2755753.2757063"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13374-9_9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840848"},{"volume-title":"Encyclopedia of Parallel Computing","author":"Feautrier Paul","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","unstructured":"Basilio B Fraguela Mart\u0131n G Carmueja and Diego Andrade. 2005. Optimal tile size selection guided by analytical models. Procedings of Parallel Computing 10 (2005).  Basilio B Fraguela Mart\u0131n G Carmueja and Diego Andrade. 2005. Optimal tile size selection guided by analytical models. Procedings of Parallel Computing 10 (2005)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926286"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743016"},{"volume-title":"High Performance Stencil Code Generation with Lift. In International Symposium on Code Generation and Optimization (CGO 18)","year":"2018","author":"Hagedorn Bastian","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000011388.54204.8e"},{"volume-title":"Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.","author":"Jeffrey","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Peter MW Knijnenburg Toru Kisuki Kyle Gallivan and Michael FP O'Boyle. 2004. The effect of cache models on iterative compilation for combined tiling and unrolling. Concurrency and Computation: Practice and Experience 16 Issues 2--3 (2004).  Peter MW Knijnenburg Toru Kisuki Kyle Gallivan and Michael FP O'Boyle. 2004. The effect of cache models on iterative compilation for combined tiling and unrolling. Concurrency and Computation: Practice and Experience 16 Issues 2--3 (2004).","DOI":"10.1002\/cpe.773"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020989410030"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/106975.106981"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13374-9_21"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925987"},{"volume-title":"Proceedings of 6th Workshop on Optimizations for DSP and Embedded Systems (ODES-6).","year":"2008","author":"Meister Benoit","key":"e_1_3_2_1_30_1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2014.115"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018782528453"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694364"},{"key":"e_1_3_2_1_34_1","article-title":"A Simplex Method for Function","volume":"7","author":"Nelder J. A.","year":"1965","journal-title":"Minimization. Comput. J."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2665079"},{"volume-title":"Online-Autotuning in the Presence of Algorithmic Choice. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).","author":"Pfaffe Philip","key":"e_1_3_2_1_36_1"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462176"},{"volume-title":"ATF: A Generic Auto-Tuning Framework. In 2017 IEEE 19th International Conference on High Performance Computing and Communications","year":"2017","author":"Rasch Ari","key":"e_1_3_2_1_38_1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/647475.727610"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Gabe Rudy. 2010. CUDA-CHiLL: A Programming Language Interface for GPGPU Optimizations and Code Generation. The University of Utah.  Gabe Rudy. 2010. CUDA-CHiLL: A Programming Language Interface for GPGPU Optimizations and Code Generation. The University of Utah.","DOI":"10.1007\/978-3-642-19595-2_10"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1153923.1154542"},{"volume-title":"LIFT: A Functional Data-Parallel IR for High-Performance GPU Code Generation. In International Symposium on Code Generation and Optimization (CGO 17)","year":"2017","author":"Steuwer Michel","key":"e_1_3_2_1_43_1"},{"volume-title":"Proceedings of the 2002 ACM\/IEEE Conference on Supercomputing (SC 02)","author":"\u0162\u0103pu\u015f Cristian","key":"e_1_3_2_1_44_1"},{"volume-title":"2009 IEEE International Symposium on Parallel Distributed Processing.","author":"Tiwari Ananta","key":"e_1_3_2_1_45_1"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.86"},{"volume-title":"Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions. arXiv preprint arXiv:1802.04730","year":"2018","author":"Vasilache Nicolas","key":"e_1_3_2_1_47_1"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"volume-title":"Polyhedral Extraction Tool. In Second International Workshop on Polyhedral Compilation Techniques (IMPACT 12)","year":"2012","author":"Verdoolaege Sven","key":"e_1_3_2_1_49_1"},{"volume-title":"Schedule Trees. In Fourth International Workshop on Polyhedral Compilation Techniques","year":"2014","author":"Verdoolaege Sven","key":"e_1_3_2_1_50_1"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1231-0"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504189"},{"volume-title":"Proceedings of the 1998 ACM\/IEEE conference on Supercomputing. IEEE Computer Society.","year":"1998","author":"Clint Whaley R","key":"e_1_3_2_1_53_1"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"R. Clint Whaley Antoine Petitet and Jack J. Dongarra. 2001. Automated Empirical Optimizations of Software and the ATLAS Project. Parallel Comput. 27 Issues 1--2 (Jan. 2001).  R. Clint Whaley Antoine Petitet and Jack J. Dongarra. 2001. Automated Empirical Optimizations of Software and the ATLAS Project. Parallel Comput. 27 Issues 1--2 (Jan. 2001).","DOI":"10.1016\/S0167-8191(00)00087-9"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840444"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772982"}],"event":{"name":"ICS '19: 2019 International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Phoenix Arizona","acronym":"ICS '19"},"container-title":["Proceedings of the ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330345.3330377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:26Z","timestamp":1750204406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330377"}},"subtitle":["a case study on polyhedral accelerator mapping"],"short-title":[],"issued":{"date-parts":[[2019,6,26]]},"references-count":54,"alternative-id":["10.1145\/3330345.3330377","10.1145\/3330345"],"URL":"https:\/\/doi.org\/10.1145\/3330345.3330377","relation":{},"subject":[],"published":{"date-parts":[[2019,6,26]]},"assertion":[{"value":"2019-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}