Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

AGTIVE
2007
Springer

favoriteEmaildiscussreport

234views Formal Methods» more AGTIVE 2007»

Graph Rewriting for Hardware Dependent Program Optimizations

13 years 10 months ago

Graph Rewriting for Hardware Dependent Program Optimizations

Download www.info.uni-karlsruhe.de

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.

Andreas Schösser, Rubino Geiß

Real-time Traffic

AGTIVE 2007 | Compiler Internal Program | Formal Languages | Rich Instructions | SIMD Instructions |

claim paper

Related Content

» Dependency Pairs for Rewriting with Nonfree Constructors

» Static Slicing of Rewrite Systems

» Termination Analysis of Logic Programs Based on Dependency Graphs

» Automated Termination Proofs for Java Programs with Cyclic Data

» A Flexible Library for Dependable MasterWorker Parallel Programs

» APT A Data Structure for Optimal Control Dependence Computation

» Transforming Process Models Executable Rewrite Rules versus a Formalized Java Program

» Hardware Support for Stability in a Persistent Architecture

» Optimizing Slicing of Formal Specifications by Deductive Verification

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	AGTIVE
Authors	Andreas Schösser, Rubino Geiß

Comments (0)