• Home
  • Search
  • Path profile guided partial dead code elimination using predication
  • Cite Icon48
  • https://doi.org/10.1109/pact.1997.644007Copy DOI Icon

Path profile guided partial dead code elimination using predication

  • Nov 23, 2002
  • R Gupta +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Presents 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
  • Citations58

Path profile guided partial dead code elimination using predication

  • Nov 11, 1997
  • Rajiv Gupta +2
  • Research Article
  • Citations49

Partial dead code elimination

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

Dead code elimination technique in eclipse compiler for Java

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

Partial dead code elimination using slicing transformations

  • May 01, 1997
  • Rastislav Bodík +1
  • Research Article
  • Citations11

Partial dead code elimination on predicated code regions

  • Jan 01, 2006
  • Software: Practice and Experience
  • Jingling Xue +2
  • Research Article
  • Citations7

Partial dead code elimination using slicing transformations

  • May 01, 1997
  • ACM SIGPLAN Notices
  • Rastislav Bodík +1
  • Book Chapter
  • Citations3

Region-Based Partial Dead Code Elimination on Predicated Code

  • Jan 01, 2004
  • Qiong Cai +2
  • Conference Article

MLEM algorithm adaptation for improved SPECT scintimammography

  • Apr 29, 2005
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Andrzej Krol +8
  • Conference Article
  • Citations18

Formal verification of dead code elimination in Isabelle/HOL

  • Jan 01, 2005
  • J.O Blech +2
  • Conference Article
  • Citations7

Code optimization as a side effect of instruction scheduling

  • Dec 18, 1997
  • R Gupta
  • Conference Article
  • Citations32

Resource-sensitive profile-directed data flow analysis for code optimization

  • Dec 01, 1997
  • Rajiv Gupta +2
  • Conference Article
  • Citations18

Resource-sensitive profile-directed data flow analysis for code optimization

  • Nov 22, 2002
  • Rajiv Gupta +2
  • Research Article
  • Citations10

Partial method compilation using dynamic profile information

  • Oct 01, 2001
  • ACM SIGPLAN Notices
  • John Whaley
  • Conference Article
  • Citations77

Partial method compilation using dynamic profile information

  • Oct 01, 2001
  • John Whaley
  • Conference Article
  • Citations19

A PVS Based Framework for Validating Compiler Optimizations

  • Oct 24, 2006
  • A Kanade +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.