Compiler Optimization: A Case for the Transformation Tool Contest
Sebastian Buchwald (Karlsruhe Institute of Technology (KIT)), Edgar, Jakumeit (Karlsruhe Institute of Technology (KIT))
TL;DR
This paper discusses compiler optimization using graph transformation tools, presenting two tasks to evaluate their performance in optimizing intermediate representations in modern compiler architectures.
Contribution
It introduces two specific compiler tasks for evaluating graph transformation tools in optimizing IRs, highlighting their application in modern compiler design.
Findings
Evaluation of tools on performance metrics
Comparison of optimization effectiveness
Insights into graph transformation capabilities
Abstract
An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of operations supported by the target hardware. In modern compiler construction graph-based IRs are employed. Optimization and lowering tasks can then be implemented with graph transformation rules. This case provides two compiler tasks to evaluate the participating tools regarding performance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.