Event Details
Speculative Partial Redundancy Elimination
Presenter: Bernhard Scholz - Institute of Computer Languages, Vienna University of Technology, Vienna, Austria
Supervisor:
Date: Fri, January 17, 2003
Time: 13:30:00 - 00:00:00
Place: EOW 430
ABSTRACT
Subject Description:
Partial redundancy elimination (PRE) is a standard compiler optimisation technique that facilitates various code motion problems. However, classical PRE approaches are very conservative and quite often miss the opportunity for optimisation. To improve the result, speculative PRE approaches were developed. In this talk a new formulation of speculative PRE is presented that gives an optimal result in polynomial time. In contrast to previous approaches the minimal number of evaluations of an expression can be found. Experimental results are shown for an implementation in the GNU Compiler Collection. The experiments were conducted with the SPEC95 Benchmark Suite.