Redundancy Elimination in the ExaStencils Code Generator
Kronawitter S, Kuckuk S, Lengauer C (2016)
Publication Language: English
Publication Type: Conference contribution
Publication year: 2016
Publisher: Springer
Series: Lecture Notes in Computer Science
City/Town: Berlin, Heidelberg, New York
Pages Range: 159-173
Conference Proceedings Title: Proceedings of the First International Workshop on Data Locality in Modern Computing Systems (DLMCS)
Event location: Granada, Spain
ISBN: 978-3-319-49956-7
DOI: 10.1007/978-3-319-49956-7_13
Abstract
Optimizing the performance of compute-bound codes requires, among other techniques, the elimination of redundant computations. The well-known concept of common subexpression elimination can achieve this in parts, and almost every production compiler conducts such an optimization. However, due to the conservative nature of these compilers, an external redundancy elimination can additionally increase the performance. For stencil codes using finite volume discretizations, an extension to eliminate redundancies between loop iterations is also very promising. We integrated both a classic common subexpression elimination and an extended version in the Exastencils code generator and present their impact on a real-world application.
Authors with CRIS profile
Related research project(s)
Involved external institutions
Germany (DE)How to cite
APA:
Kronawitter, S., Kuckuk, S., & Lengauer, C. (2016). Redundancy Elimination in the ExaStencils Code Generator. In Proceedings of the First International Workshop on Data Locality in Modern Computing Systems (DLMCS) (pp. 159-173). Granada, Spain: Berlin, Heidelberg, New York: Springer.
MLA:
Kronawitter, Stefan, Sebastian Kuckuk, and Christian Lengauer. "Redundancy Elimination in the ExaStencils Code Generator." Proceedings of the First International Workshop on Data Locality in Modern Computing Systems (DLMCS 2016), Granada, Spain Berlin, Heidelberg, New York: Springer, 2016. 159-173.
BibTeX: Download