• Home
  • Search
  • Efficient Run Time Optimization with Static Single Assignment
  • https://doi.org/10.1007/978-1-4615-4489-0_9Copy DOI Icon

Efficient Run Time Optimization with Static Single Assignment

  • Jan 1, 2000
  • Jason W Kim +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

We introduce a novel optimization engine for META4, a new object oriented language currently under development. It uses Static Single Assignment (henceforth SSA) form coupled with certain reasonable, albeit rare language features. The result is a reduction of the optimizer’s code footprint and an increase of its “reuse” factor. This engine performs the following optimizations; Dead Code Elimination (DCE), Common Subexpression Elimination (CSE) and Constant Propagation (CP). It performs these optimizations at both runtime and compile time with linear complexity time. Also, CP is essentially free, whether the values are really source-code constants or specific values generated at runtime. CP runs along side with the other optimization passes, thus allowing the efficient runtime specialization of the code during any point of the program’s lifetime.

Similar Papers
  • Conference Article
  • Citations3

Dead code elimination technique in eclipse compiler for Java

  • Dec 01, 2015
  • Hiral H Karer +1
  • Research Article
  • Citations1

Computing SSA Form with Matrices

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

Static optimization in PHP 7

  • Feb 05, 2017
  • Nikita Popov +3
  • Conference Article

An approach for pointer optimization using SSA based intermediate representation

  • Jun 01, 2011
  • Deodatta Barhate +1
  • Conference Article
  • Citations18

Formal verification of dead code elimination in Isabelle/HOL

  • Jan 01, 2005
  • J.O Blech +2
  • Conference Article
  • Citations14

Efficient static single assignment form for predication

  • Aug 25, 2005
  • A Stoutchinin +1
  • Conference Article
  • Citations13

Efficient static single assignment form for predication

  • Dec 01, 2001
  • Arthur Stoutchinin +1
  • Conference Article
  • Citations3

Lambda the Ultimate SSA: Optimizing Functional Programs in SSA

  • Apr 02, 2022
  • Siddharth Bhat +1
  • Book Chapter
  • Citations84

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

  • Jan 01, 1998
  • Jaejin Lee +2
  • 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
  • Citations26

Extended SSA mumbering: Introducing SSA properties to languages with multi-level pointers

  • Jan 01, 1998
  • Christopher Lapkowski +1
  • Book Chapter
  • Citations22

Efficient Execution of Multi-query Data Analysis Batches Using Compiler Optimization Strategies

  • Jan 01, 2004
  • Henrique Andrade +4
  • Conference Article
  • Citations118

Dependence-based program analysis

  • Jun 01, 1993
  • Richard Johnson +1
  • Research Article
  • Citations17

Dependence-based program analysis

  • Jun 01, 1993
  • ACM SIGPLAN Notices
  • Richard Johnson +1
  • Research Article
  • Citations97

Coordinated parallelizing compiler optimizations and high-level synthesis

  • Oct 01, 2004
  • ACM Transactions on Design Automation of Electronic Systems
  • Sumit Gupta +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.