Polyhedral Search Space Exploration in the ExaStencils Code Generator
- 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.
Author: | Stefan Kronawitter, Christian Lengauer |
---|---|
URN: | urn:nbn:de:bvb:739-opus4-5778 |
DOI: | https://doi.org/10.1145/3274653 |
ISSN: | 1544-3973 |
Parent Title (English): | ACM Transactions on Architecture and Code Optimization |
Document Type: | Article |
Language: | English |
Year of Completion: | 2018 |
Date of Publication (online): | 2018/10/10 |
Date of first Publication: | 2018/10/10 |
Publishing Institution: | Universität Passau |
Release Date: | 2018/10/18 |
Tag: | Discrete space search; Software performance; Source code generation |
Volume: | 15 |
Issue: | 4 |
Institutes: | Fakultät für Informatik und Mathematik |
Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke |
open_access (DINI-Set): | open_access |
Funding Acknowledgement: | Gefördert durch den Open-Access-Publikationsfonds der Universitätsbibliothek Passau. |
Licence (German): | Standardbedingung laut Einverständniserklärung |