• Home
  • Search
  • Region-Based Partial Dead Code Elimination on Predicated Code
  • Cite Icon3
  • https://doi.org/10.1007/978-3-540-24723-4_11Copy DOI Icon

Region-Based Partial Dead Code Elimination on Predicated Code

  • Jan 1, 2004
  • Qiong Cai +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in an existing compiler framework. Our algorithm processes PDE candidates using a worklist and reasons about their partial deadness using predicate partition graphs. It operates uniformly on hyperblocks and regions comprising basic blocks and hyperblocks. The result of applying our algorithm to an SEME region is optimal: partially dead code cannot be removed without changing the branching structure of the program or potentially introducing new predicate defining instructions. We present statistic evidence about the PDE opportunities in the 12 SPECint2000 benchmarks. In addition to exhibit small compilation overheads, our algorithm achieves moderate performance improvements in 8 out of the 12 benchmarks on an Itanium machine. Our performance results and statistics show the usefulness of our algorithm as a pass applied before instruction scheduling.

Similar Papers
  • Research Article
  • Citations11

Partial dead code elimination on predicated code regions

  • Jan 01, 2006
  • Software: Practice and Experience
  • Jingling Xue +2
  • 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
  • Conference Article
  • Citations62

Partial dead code elimination using slicing transformations

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

Code optimization as a side effect of instruction scheduling

  • Dec 18, 1997
  • R Gupta
  • 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
  • Research Article
  • Citations7

Partial dead code elimination using slicing transformations

  • May 01, 1997
  • ACM SIGPLAN Notices
  • Rastislav Bodík +1
  • Research Article
  • Citations49

Partial dead code elimination

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

A PVS Based Framework for Validating Compiler Optimizations

  • Oct 24, 2006
  • A Kanade +2
  • Book Chapter
  • Citations5

A code motion framework for global instruction scheduling

  • Jan 01, 1998
  • Rajiv Gupta
  • Book Chapter
  • Citations1

Partial dead code elimination for parallel programs

  • Jan 01, 1996
  • Jens Knoop
  • Research Article
  • Citations114

Parallelism for free

  • May 01, 1996
  • ACM Transactions on Programming Languages and Systems
  • Jens Knoop +2
  • Conference Article
  • Citations48

Path profile guided partial dead code elimination using predication

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

Path profile guided partial dead code elimination using predication

  • Nov 11, 1997
  • Rajiv Gupta +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.