• Home
  • Search
  • Partial dead code elimination for parallel programs
  • Cite Icon1
  • https://doi.org/10.1007/3-540-61626-8_59Copy DOI Icon

Partial dead code elimination for parallel programs

  • Jan 1, 1996
  • Jens Knoop
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Eliminating partially dead code has proved to be a powerful technique for the runtime optimization of sequential programs. Here, we show how this technique can be adapted to parallel programs with shared memory and interleaving semantics on the basis of a recently presented framework for efficient and precise bitvector analyses for parallel programs. Whereas the framework allows a straightforward adaptation of the required data flow analyses to the parallel case, the transformation part of the optimization requires special care in order to preserve parallelism. This preservation is an absolute must in order to guarantee that the optimization does never impair efficiency. The introduction of an appropiate natural side condition suffices to lift even the optimality result known from the sequential setting to the parallel setting.

Similar Papers
  • Research Article
  • Citations49

Partial dead code elimination

  • Jun 01, 1994
  • ACM SIGPLAN Notices
  • Jens Knoop +2
  • Research Article
  • Citations11

Partial dead code elimination on predicated code regions

  • Jan 01, 2006
  • Software: Practice and Experience
  • Jingling Xue +2
  • Book Chapter
  • Citations3

Region-Based Partial Dead Code Elimination on Predicated Code

  • Jan 01, 2004
  • Qiong Cai +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
  • 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
  • Research Article
  • Citations7

Partial dead code elimination using slicing transformations

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

Non-monotone fixpoint iterations to resolve second order effects

  • Jan 01, 1996
  • Alfons Geser +4
  • Conference Article
  • Citations19

A PVS Based Framework for Validating Compiler Optimizations

  • Oct 24, 2006
  • A Kanade +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
  • Book Chapter
  • Citations5

A code motion framework for global instruction scheduling

  • Jan 01, 1998
  • Rajiv Gupta
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.