See this document in CiteSeerX!

Accurate Static Branch Prediction by Value Range Propagation (1995)  (Make Corrections)  (39 citations)
Jason R. C. Patterson
SIGPLAN Conference on Programming Language Design and Implementation



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
qut.edu.au/TR/techrep...FITTR9505.ps
pattosoft.com.au/j...lueRangeProp.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  qut.edu.au/TR/techreport...README (more)
From:  rutgers.edu/~mhsiao/ece...reading
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The ability to predict at compile time the likelihood of a particular branch being taken provides valuable information for several optimizations, including global instruction scheduling, code layout, function inlining, interprocedural register allocation and many high level optimizations. Previous attempts at static branch prediction have either used simple heuristics, which can be quite inaccurate, or put the burden onto the programmer by using execution profiling data or source code hints.... (Update)

Cited by:   More
Pointer-Range Analysis - Yong, Horwitz (2004)   (Correct)
Automatic Vulnerability Detection Using Static Source Code Analysis - Sotirov (2005)   (Correct)
Symbolic Bounds Analysis of Pointers, Array Indices, and.. - Rugina, Rinard (2000)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Adaptive Compilation for Complex Uniprocessor Hardware - Daumueller, Stefanovic (1994)   (Correct)
0.3:   Profile-Driven Compilation - Alan Dain Samples (1991)   (Correct)
0.2:   Automatic Annotation Of Instructions With Profiling Information - Johnson (1995)   (Correct)

Similar documents based on text:   More   All
0.1:   Advanced Workflow Patterns - van der Aalst, Barros, Hofstede.. (2000)   (Correct)
0.1:   Towards A Semantic Framework For Service Description - Dumas, O'Sullivan.. (2001)   (Correct)
0.1:   A Comparative Study of Static and Profile-Based.. - Arnold, Fink, Sarkar, .. (2000)   (Correct)

Related documents from co-citation:   More   All
14:   Compiler analysis of the value ranges of variables (context) - Harrison - 1977
9:   Optimization of range checking (context) - Markstein, Cocke et al. - 1982
8:   Elimination of redundant array subscript range checks - Kolte, Wolfe - 1995

BibTeX entry:   (Update)

J.R.C. Patterson. Accurate static branch prediction by value range propagation. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 67--78, 1995. http://citeseer.ist.psu.edu/patterson95accurate.html   More

@inproceedings{ patterson95accurate,
    author = "Jason R. C. Patterson",
    title = "Accurate Static Branch Prediction by Value Range Propagation",
    booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
    pages = "67-78",
    year = "1995",
    url = "citeseer.ist.psu.edu/patterson95accurate.html" }
Citations (may not include all citations):
415   Efficiently Computing Static Single Assignment Form and the .. - Cytron, Ferrante et al. - 1991  ACM   DBLP
407   Trace Scheduling: A Technique for Global Microcode Compactio.. (context) - Fisher - 1981  DBLP
299   Dependence Analysis for Supercomputing (context) - Banerjee - 1988  ACM
241   A Study of Branch Prediction Strategies (context) - Smith - 1981  ACM   DBLP
232   Constant Propagation with Conditional Branches (context) - Wegman, Zadeck - 1991  ACM   DBLP
183   Profile Guided Code Positioning (context) - Pettis, Hansen - 1990  ACM   DBLP
156   A Unified Approach to Global Program Optimization (context) - Kildall - 1973  ACM   DBLP
130   Optimally Profiling and Tracing Programs - Ball, Larus - 1992  ACM   DBLP
115   Program Optimization for Instruction Caches (context) - McFarling - 1989  ACM   DBLP
107   Global Instruction Scheduling for Superscalar Machines (context) - Bernstein, Rodeh - 1991  ACM   DBLP
103   Predicting Conditional Branch Directions From Previous Runs .. (context) - Fisher, Freudenberger - 1992  ACM   DBLP
99   Global Register Allocation at Link Time - Wall - 1986
96   Branch Prediction For Free - Ball, Larus - 1993  ACM   DBLP
94   Using Profile Information to Assist Classic Code Optimizatio.. - Chang, Mahlke et al. - 1991  ACM   DBLP
84   Reducing the Cost of Branches (context) - McFarling, Hennessy - 1986  ACM   DBLP
66   Interprocedural Constant Propagation (context) - Callahan, Cooper et al. - 1986  ACM   DBLP
61   Dependence-Based Program Analysis - Johnson, Pingali - 1993  ACM   DBLP
60   Predicting Program Behavior Using Real or Estimated Profiles - Wall - 1991  ACM   DBLP
59   Compiler Analysis of the Value Ranges for Variables (context) - Harrison - 1977  DBLP
40   Accurate Static Estimators for Program Optimization (context) - Wagner, Maverick et al. - 1994  ACM   DBLP
40   Optimizing Array Bound Checks Using Flow Analysis - Gupta - 1993  ACM   DBLP
33   Interprocedural Constant Propagation: A Study of Jump Functi.. - Grove, Torczon - 1993  DBLP
28   A Simple Interprocedural Register Allocation Algorithm and I.. (context) - Steenkiste, Hennessy - 1989  ACM   DBLP
27   Static Branch Frequency and Program Profile Analysis - Wu, Larus - 1994  ACM   DBLP
24   CCG: A Prototype Coagulating Code Generator (context) - Morris - 1991  DBLP
24   Symbolic Evaluation and the Global Value Graph (context) - Reif, Lewis - 1977  ACM   DBLP
20   Interprocedural Constant Propagation: An Empirical Study (context) - Metzger, Stroud - 1993  DBLP
20   Improving Semi-Static Branch Prediction by Code Replication - Krall - 1994  ACM   DBLP
6   Register Windows vs Register Allocation - Wall - 1988
3   Code Generation by Coagulation (context) - Karr - 1984  ACM   DBLP
1   International Conference on Computer Languages (context) - Cooper, Hall et al. - 1992



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://sky.fit.qut.edu.au/TR/techreports/README.html):   More
Spatial Clustering for Data Mining with Genetic Algorithms - Estivill-Castro, Murray (1997)   (Correct)
Using A Double Weighted Clustering Technique for Fragment.. - Semeczko   (Correct)
Patterns in Geographical Data via Maximum Entropy Classification - Estivill-Castro (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC