• Home
  • Search
  • Future value based single assignment program representations and optimizations
  • Cite Icon1
  • https://doi.org/10.37099/mtu.dc.etds/177Copy DOI Icon

Future value based single assignment program representations and optimizations

  • Jan 1, 2012
  • Shuhan Ding
Show More
  • Abstract
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

An optimizing compiler internal representation fundamentally affects the clarity, efficiency and feasibility of optimization algorithms employed by the compiler. Static Single Assignment (SSA) as a state-of-the-art program representation has great advantages though still can be improved. This dissertation explores the domain of single assignment beyond SSA, and presents two novel program representations: Future Gated Single Assignment (FGSA) and Recursive Future Predicated Form (RFPF). Both FGSA and RFPF embed control flow and data flow information, enabling efficient traversal program information and thus leading to better and simpler optimizations. We introduce future value concept, the designing base of both FGSA and RFPF, which permits a consumer instruction to be encountered before the producer of its source operand(s) in a control flow setting. We show that FGSA is efficiently computable by using a series T1/T2/TR transformation, yielding an expected linear time algorithm for combining together the construction of the pruned single assignment form and live analysis for both reducible and irreducible graphs. As a result, the approach results in an average reduction of 7.7%, with a maximum of 67% in the number of gating functions compared to the pruned SSA form on the SPEC2000 benchmark suite. We present a solid and near optimal framework to perform inverse transformation from single assignment programs. We demonstrate the importance of unrestricted code motion and present RFPF. We develop algorithms which enable instruction movement in acyclic, as well as cyclic regions, and show the ease to perform optimizations such as Partial Redundancy Elimination on RFPF.

Loading PDF

Similar Papers
  • Research Article
  • Citations1

Computing SSA Form with Matrices

  • Jul 01, 2007
  • Electronic Notes in Theoretical Computer Science
  • Quan Hoang Nguyen
  • Research Article
  • Citations11

Anticipation‐based partial redundancy elimination for static single assignment form

  • Aug 25, 2004
  • Software: Practice and Experience
  • Thomas Vandrunen +1
  • Conference Article
  • Citations87

A linear time algorithm for placing φ-nodes

  • Jan 01, 1995
  • Vugranam C Sreedhar +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
  • Book Chapter

Locality Based Static Single Assignment Partial Redundancy Elimination

  • Jan 01, 2013
  • Sivananaintha Perumal +1
  • Research Article
  • Citations5

A Practical Improvement to the Partial Redundancy Elimination in SSA Form

  • Sep 30, 2008
  • Journal of Computing Science and Engineering
  • Jong-Soo Park +1
  • Conference Article
  • Citations286

Detecting Code Clones with Graph Neural Network and Flow-Augmented Abstract Syntax Tree

  • Feb 01, 2020
  • Wenhan Wang +4
  • Research Article
  • Citations41

Algorithms for computing the static single assignment form

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

Lambda the Ultimate SSA: Optimizing Functional Programs in SSA

  • Apr 02, 2022
  • Siddharth Bhat +1
  • Research Article
  • Citations46

An extensible program representation for object-oriented software

  • Dec 01, 1994
  • ACM SIGPLAN Notices
  • Brian A Malloy +3
  • Research Article
  • Citations38

A Functional Perspective on SSA Optimisation Algorithms

  • Apr 01, 2004
  • Electronic Notes in Theoretical Computer Science
  • Manuel M.T Chakravarty +2
  • Conference Article
  • Citations3

Dead code elimination technique in eclipse compiler for Java

  • Dec 01, 2015
  • Hiral H Karer +1
  • Book Chapter
  • Citations10

Securing the SSA Transform

  • Jan 01, 2017
  • Chaoqiang Deng +1
  • Research Article

Optymalizacja kodu przy wykorzystaniu algorytmu ssa w środowiskach maszyn wirtualnych

  • Jun 08, 2016
  • Szczepan Kras +1
  • Book Chapter
  • Citations6

Partial Value Number Redundancy Elimination

  • Jan 01, 2005
  • Rei Odaira +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.