Predicated Partial Redundancy Elimination using a Cost Analysis
| Autor: | R. Nigel Horspool, Bernhard Scholz, Eduard Mehofer |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Theoretical computer science
Computer science Distributed computing Probabilistic logic Optimizing compiler Partial redundancy elimination computer.software_genre Theoretical Computer Science Data flow diagram Transformation (function) Hardware and Architecture Key (cryptography) Redundancy (engineering) Compiler computer Software |
| Zdroj: | Parallel Processing Letters. 13:525-536 |
| ISSN: | 1793-642X 0129-6264 |
| DOI: | 10.1142/s0129626403001483 |
| Popis: | Partial redundancy elimination (PRE) is a key technology for modern compilers. However traditional approaches are conservative and fail to exploit many opportunities for optimization. New PRE approaches which greatly increase the number of eliminated redundancies have been developed. However, they either cause the code size to explode or they cannot handle statements with side-effects. In this paper we describe a predicated partial redundancy elimination (PPRE) approach which can potentially remove all partial redundancies. To avoid performance overheads caused by predication, PPRE is applied selectively based on a cost model. The cost analysis presented in the paper utilizes probabilistic data-flow information to decide whether PPRE is profitable for each instance of a partially redundant computation. Refinements of the basic PPRE transformation are described in detail. In contrast to some other approaches our transformation is strictly semantics preserving. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|