Partial Redundancy Elimination using Lazy Code Motion

05/20/2019
by   Sandeep Dasgupta, et al.
0

Partial Redundancy Elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not necessarily all paths through a program. In this project, we implemented a PRE optimization pass in LLVM and measured results on a variety of applications. We chose PRE because it is a powerful technique that subsumes Common Subexpression Elimination (CSE) and Loop Invariant Code Motion (LICM), and hence has the potential to greatly improve performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2021

Simple, Light, Yet Formally Verified, Global Common Subexpression Elimination and Loop-Invariant Code Motion

We present an approach for implementing a formally certified loop-invari...
research
12/24/2019

Aggressive Aggregation: a New Paradigm for Program Optimization

In this paper, we propose a new paradigm for program optimization which ...
research
11/21/2020

lospre in linear time

Lifetime-optimal speculative partial redundancy elimination (lospre) is ...
research
06/25/2019

Partial Quantifier Elimination With Learning

We consider a modification of the Quantifier Elimination (QE) problem ca...
research
03/21/2020

Partial Quantifier Elimination By Certificate Clauses

We study a modification of the Quantifier Elimination (QE) problem calle...
research
12/28/2018

Task Elimination may Actually Increase Throughput Time

The well-known Task Elimination redesign principle suggests to remove un...
research
06/09/2019

Partial Server Pooling in Redundancy Systems

Partial sharing allows providers to possibly pool a fraction of their re...

Please sign up or login with your details

Forgot password? Click here to reset