• Home
  • Search
  • Path profile guided partial dead code elimination using predication
  • Cite Icon58
  • https://doi.org/10.5555/522659.825652Copy DOI Icon

Path profile guided partial dead code elimination using predication

  • Nov 11, 1997
  • Rajiv Gupta +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present a path profile guided partial dead code elimination algorithm that uses predication to enable sinking for the removal of deadness along frequently executed paths at the expense of adding additional instructions along infrequently executed paths. Our approach to optimization is particularly suitable for VLIW architectures since it directs the efforts of the optimizer towards aggressively enabling generation of fast schedules along frequently executed paths by reducing their critical path lengths. The paper presents a cost-benefit data flow analysis that uses path profiling information to determine the profitability of using predication enabled sinking. The cost of predication enabled sinking of a statement past a merge point is determined by identifying paths along which an additional statement is introduced. The benefit of predication enabled sinking is determined by identifying paths along which additional dead code elimination is achieved due to predication. The results of this analysis are incorporated in a code sinking framework in which predication enabled sinking is allowed past merge points only if its benefit is determined to be greater than the cost. It is also demonstrated that trade-off can be performed between the compile time cost and the precision of cost-benefit analysis.

Similar Papers
  • Conference Article
  • Citations48

Path profile guided partial dead code elimination using predication

  • Nov 23, 2002
  • R Gupta +2
  • Conference Article
  • Citations102

Edge profiling versus path profiling

  • Jan 01, 1998
  • Thomas Ball +2
  • Research Article
  • Citations49

Partial dead code elimination

  • Jun 01, 1994
  • ACM SIGPLAN Notices
  • Jens Knoop +2
  • Conference Article
  • Citations12

An efficient online path profiling framework for Java just-in-time compilers

  • Mar 22, 2004
  • T Yasue +3
  • Conference Article
  • Citations31

Targeted path profiling: lower overhead path profiling for staged dynamic optimization systems

  • Jun 28, 2015
  • R Joshi +1
  • Conference Article
  • Citations418

Efficient path profiling

  • Dec 23, 2002
  • T Ball +1
  • Conference Article
  • Citations17

An efficient online path profiling framework for Java just-in-time compilers

  • Sep 27, 2003
  • Toshiaki Yasue +3
  • Conference Article
  • Citations54

Practical Path Profiling for Dynamic Optimizers

  • Mar 31, 2005
  • M.D Bond +1
  • Conference Article
  • Citations46

Targeted path profiling: lower overhead path profiling for staged dynamic optimization systems

  • Mar 20, 2004
  • Rahul Raghvendra Joshi +2
  • Conference Article
  • Citations570

Efficient path profiling

  • Dec 02, 1996
  • Thomas Ball +1
  • Conference Article
  • Citations62

Partial dead code elimination using slicing transformations

  • May 01, 1997
  • Rastislav Bodík +1
  • Conference Article
  • Citations86

Path profile guided partial redundancy elimination using speculation

  • May 14, 1998
  • R Gupta +2
  • Conference Article
  • Citations3

Dead code elimination technique in eclipse compiler for Java

  • Dec 01, 2015
  • Hiral H Karer +1
  • Conference Article
  • Citations10

Pertinent path profiling: Tracking interactions among relevant statements

  • Feb 01, 2013
  • R Chouhan +2
  • Conference Article
  • Citations53

Preferential path profiling

  • Jan 17, 2007
  • Kapil Vaswani +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.