Abstract
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. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Schösser, A., & Geiß, R. (2008). Graph rewriting for hardware dependent program optimizations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5088 LNCS, pp. 233–248). Springer Verlag. https://doi.org/10.1007/978-3-540-89020-1_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
