• Home
  • Search
  • Efficient static single assignment form for predication
  • Cite Icon13
  • https://doi.org/10.5555/563998.564022Copy DOI Icon

Efficient static single assignment form for predication

  • Dec 1, 2001
  • Arthur Stoutchinin +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present a framework that allows translation of predicated code into the static single assignment (SSA) form, and simplifies application of the SSA-based optimizations to predicated code. In particular we represent predicate join points in the program by the /spl Psi/-functions similar to the /spl Phi/-functions of the basic SSA. The SSA-based optimizations (such as constant propagation) can be applied to predicated code by simply specifying additional rules for processing the /spl Psi/-functions. We present efficient algorithms for constructing, and then for removing the /spl Psi/-functions at the end of SSA processing. Our algorithm for translating out of the /spl Psi/-SSA splits predicated live ranges into smaller live ranges active under disjoint predicates. The experimental evaluation on a set of predicated benchmarks demonstrates efficiency of our approach.

Similar Papers
  • Conference Article
  • Citations14

Efficient static single assignment form for predication

  • Aug 25, 2005
  • A Stoutchinin +1
  • Research Article
  • Citations132

Practical improvements to the construction and destruction of static single assignment form

  • Jul 10, 1998
  • Software: Practice and Experience
  • Preston Briggs +3
  • Conference Article
  • Citations13

Verified construction of static single assignment form

  • Mar 17, 2016
  • Sebastian Buchwald +2
  • Book Chapter
  • Citations9

If-Conversion in SSA Form

  • Jan 01, 2004
  • Arthur Stoutchinin +1
  • Book Chapter
  • Citations18

Incremental computation of static single assignment form

  • Jan 01, 1996
  • Jong -Deok Choi +2
  • Research Article
  • Citations41

Algorithms for computing the static single assignment form

  • May 01, 2003
  • Journal of the ACM
  • Gianfranco Bilardi +1
  • Research Article
  • Citations3

Structural Encoding of Static Single Assignment Form

  • Nov 25, 2005
  • Electronic Notes in Theoretical Computer Science
  • Andreas Gal +2
  • Book Chapter
  • Citations6

The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations

  • Jan 01, 2010
  • Subhajit Roy +1
  • Conference Article
  • Citations8

Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design

  • Nov 01, 2007
  • Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design
  • Philip Brisk +2
  • Conference Article
  • Citations153

Array SSA form and its use in parallelization

  • Jan 01, 1998
  • Kathleen Knobe +1
  • Book Chapter
  • Citations84

Concurrent static single assignment form and constant propagation for explicitly parallel programs

  • Jan 01, 1998
  • Jaejin Lee +2
  • Research Article
  • Citations1

Computing SSA Form with Matrices

  • Jul 01, 2007
  • Electronic Notes in Theoretical Computer Science
  • Quan Hoang Nguyen
  • Conference Article
  • Citations8

A type system equivalent to static single assignment

  • Jul 10, 2006
  • Yutaka Matsuno +1
  • Conference Article
  • Citations60

Linear scan register allocation on SSA form

  • Apr 24, 2010
  • Christian Wimmer +1
  • Research Article
  • Citations38

A Functional Perspective on SSA Optimisation Algorithms

  • Apr 01, 2004
  • Electronic Notes in Theoretical Computer Science
  • Manuel M.T Chakravarty +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.