Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Efficiently computing static single assignment form and the control dependence graph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic algorithm recognition and replacement: a new approach to program optimization
Automatic algorithm recognition and replacement: a new approach to program optimization
On the importance of points-to analysis and other memory disambiguation methods for C programs
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Engineering A Compiler
GrGen: a fast SPO-based graph rewriting tool
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code
Applications of Graph Transformations with Industrial Relevance
GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool
Applications of Graph Transformations with Industrial Relevance
GReTL: an extensible, operational, graph-based transformation language
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
We present a compiler internal program optimization that uses graph rewriting. This optimization enables the compiler to automatically use rich instructions (such as SIMD instructions) provided by modern CPUs and is transparent to the user of the compiler. New instructions can be introduced easily by specifying their behaviour in a high-level programming language. The optimization is integrated into an existing compiler, gaining high speedup.