Paper Info
Title
The hot path SSA form: extending the static single assignment form for speculative optimizations
Abstract
The Static Single Assignment (SSA) form has been an eminent contribution towards analyzing programs for compiler optimizations. It has been affable to the design of simpler algorithms for existing optimizations, and has facilitated the development of new ones. However, speculative optimizations — optimizations targeted towards speeding-up the “common cases” of a program — have not been fortunate enough to savor an SSA-like intermediate form. We extend the SSA form for speculative analyses and optimizations by allowing only hot reaching definitions — definitions along frequent acyclic paths in the program profile — to reach its respective uses; we call this representation the Hot Path SSA form. We propose an algorithm for constructing such a form, and demonstrate its effectiveness by designing the analysis phase of a novel optimization — Speculative Sparse Conditional Constant Propagation: an almost obvious extension of Wegman and Zadeck's Sparse Conditional Constant Propagation algorithm. Our experiments on some SPEC2000 programs proves the potency of such an optimization.
Year
DOI
Venue
2010
10.1007/978-3-642-11970-5_17
CC
Keywords
Field
DocType
constant propagation algorithm,speculative optimizations,hot path ssa form,compiler optimizations,sparse conditional,static single assignment form,ssa-like intermediate form,constant propagation,ssa form,speculative sparse conditional,spec2000 program,compiler optimization,static single assignment
Constant folding,Topological order,Sparse conditional constant propagation,Computer science,Parallel computing,Algorithm,Optimizing compiler,Dominator,Static single assignment form,Program profile
Conference
Volume
ISSN
ISBN
6011
0302-9743
3-642-11969-7
Citations 
PageRank 
References 
5
0.42
19
Authors
2
Name
Order
Citations
PageRank
Subhajit Roy14510.84
Y. N. Srikant225132.04