• Home
  • Search
  • Resource-sensitive profile-directed data flow analysis for code optimization
  • Cite Icon32
  • https://doi.org/10.5555/266800.266836Copy DOI Icon

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

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

Instruction schedulers employ code motion as a means of instruction reordering to enable scheduling of instructions at points where the resources required for their execution are available. In addition, driven by the profiling data, schedulers take advantage of predication and speculation for aggressive code motion across conditional branches. Optimization algorithms for partial dead code elimination (PDE) and partial redundancy elimination (PRE) employ code sinking and hoisting to enable optimization. However, unlike instruction scheduling, these optimization algorithms are unaware of resource availability and are incapable of exploiting profiling information, speculation, and predication. In this paper we develop data flow algorithms for performing the above optimizations with the following characteristics: (i) opportunities for PRE and PDE enabled by hoisting and sinking are exploited; (ii) hoisting and sinking of a code statement is driven by availability of functional unit resources; (iii) predication and speculation is incorporated to allow aggressive hoisting and sinking; and (iv) path profile information guides predication and speculation to enable optimization.

Similar Papers
  • Conference Article
  • Citations18

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

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

Partial dead code elimination on predicated code regions

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

Code optimization as a side effect of instruction scheduling

  • Dec 18, 1997
  • R Gupta
  • Book Chapter
  • Citations3

Region-Based Partial Dead Code Elimination on Predicated Code

  • Jan 01, 2004
  • Qiong Cai +2
  • Book Chapter
  • Citations5

A code motion framework for global instruction scheduling

  • Jan 01, 1998
  • Rajiv Gupta
  • Conference Article
  • Citations136

Complete removal of redundant expressions

  • May 01, 1998
  • Rastislav Bodík +2
  • Research Article
  • Citations4

Complete removal of redundant expressions

  • Apr 01, 2004
  • ACM SIGPLAN Notices
  • Rastislav Bodík +2
  • Research Article
  • Citations22

Complete removal of redundant expressions

  • May 01, 1998
  • ACM SIGPLAN Notices
  • Rastislav Bodík +2
  • Research Article
  • Citations14

Partial redundancy elimination for access expressions by speculative code motion

  • Jun 07, 2004
  • Software: Practice and Experience
  • Motohiro Kawahito +2
  • Conference Article
  • Citations62

Partial dead code elimination using slicing transformations

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

Partial redundancy elimination driven by a cost-benefit analysis

  • Nov 22, 2002
  • R.N Horspool +1
  • Conference Article
  • Citations19

A PVS Based Framework for Validating Compiler Optimizations

  • Oct 24, 2006
  • A Kanade +2
  • Research Article
  • Citations14

E-path_PRE

  • Aug 01, 2002
  • ACM SIGPLAN Notices
  • Dhananjay M Dhamdhere
  • Conference Article
  • Citations61

A compiler framework for speculative analysis and optimizations

  • May 09, 2003
  • Jin Lin +6
  • Research Article
  • Citations56

A compiler framework for speculative analysis and optimizations

  • May 09, 2003
  • ACM SIGPLAN Notices
  • Jin Lin +6
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.