Michael P. Gerlek, Michael Wolfe, Eric Stoltz Oregon Graduate Institute of...  Home/Search
Context Related
| ogi.edu/pub/techreports...94029.ps.gz ogi.edu/Sparse/pape...gerlek.live.94.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ogi.edu/Sparse/sparse.papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The classical dataflow approach to determine the set of variables that are live at some point in a program entails using an iterative algorithm across the entire program, usually with costly bitvector data structures. Methods based on sparse evaluation graphs exist, but these are solved on a per-variable basis and are also iterative. Inspired by our group's interest in sparse representations of use-def and def-use reference chains, we are investigating still another approach. In this paper, we... (Update)
Context of citations to this paper: More
.... the classical dead code elimination that we use requires live variable analysis, and the existing live variable algorithm for SSA form [8] is asymptotically slower than the classical iterative algorithm. However, dead code elimination can be implemented using SSA form (with...
.... propagation [WZ91] value numbering [AWZ88, RWZ88, CS95a] induction variable analysis [GSW95, LLC96] live range computation [GWS94] and global code motion [Cli95] All these uses of SSA have been restricted to solving problems based on program variables, since the...
Cited by: More
Partial Redundancy Elimination in SSA Form - Kennedy, Chan, LIU, LO, TU, CHOW (1999) (Correct)
A New Algorithm for Partial Redundancy Elimination.. - Chow, Chan, Kennedy, .. (1997) (Correct)
A Global Code Optimizer Utilizing Static Single Assignment Form - Sjödin (1997) (Correct)
Active bibliography (related documents): More All
0.2: The Program Structure Tree: Computing Control Regions in.. - Johnson, Pearson, Pingali (1994) (Correct)
0.2: Practical Improvements to the Construction and.. - Briggs, Cooper.. (1998) (Correct)
0.2: Incremental Computation: A Semantics-Based Systematic.. - Liu (1996) (Correct)
Similar documents based on text: More All
0.2: Beyond Induction Variables: Detecting and Classifying.. - Gerlek, Stoltz, Wolfe (1995) (Correct)
0.2: Beyond Induction Variables: Detecting and Classifying.. - Gerlek, Stoltz, Wolfe (1995) (Correct)
0.1: Constant Propagation: A Fresh, Demand-Driven Look - Stoltz, Wolfe, Gerlek (1994) (Correct)
Related documents from co-citation: More All
3: Constant propagation with conditional branches (context) - Wegman, Zadeck - 1985
3: Efficiently Computing Static Single Assignment Form and the Control Dependence G.. - Cytron, Ferrante et al. - 1991
2: Incremental computation of static single assignment form (context) - Choi, Sarkar et al. - 1994
BibTeX entry: (Update)
Michael P. Gerlek, Michael Wolfe, and Eric Stoltz. A reference chain approach for live variables. Technical Report ARPA grant F3062-92-C135, Department of Computer Science and Engineering, Oregon Graduate Institue of Science & Technology, April 1994. http://citeseer.ist.psu.edu/gerlek94reference.html More
@misc{ gerlek94reference,
author = "M. Gerlek and M. Wolfe and E. Stoltz",
title = "A reference chain approach for live variables",
text = "Michael P. Gerlek, Michael Wolfe, and Eric Stoltz. A reference chain approach
for live variables. Technical Report ARPA grant F3062-92-C135, Department
of Computer Science and Engineering, Oregon Graduate Institue of Science
& Technology, April 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/gerlek94reference.html" }
Citations (may not include all citations):1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
415 Efficiently computing Static Single Assignment form and the .. - Cytron, Ferrante et al. - 1991
405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972
152 An efficient method of computing static single assignment fo.. (context) - Cytron, Ferrante et al. - 1989
78 Register allocation via graph coloring - Briggs - 1992
71 Supercomputer performance evaluation and the Perfect Benchma.. - Cybenko, Kipp et al. - 1990
53 Automatic construction of sparse data flow evaluation graphs (context) - Choi, Cytron et al. - 1991
50 How to analyze large programs efficiently and informatively (context) - Dhamdhere, Rosen et al. - 1992
16 Extended SSA with factored use-def chains to support optimiz.. - Stoltz, Gerlek et al. - 1994
15 Fischer and Richard J (context) - Charles - 1988
8 McGraw-Hill Book Company (context) - Adams, Brainerd et al. - 1992
5 Incremental data flow analysis in a structured program edito.. (context) - Zadeck - 1984
1 Demand-driven data flow analysis (context) - Wolfe, Gerlek et al. - 1994
Documents on the same site (http://www.cse.ogi.edu/Sparse/sparse.papers.html): More
Effectiveness of Message Strip-Mining for Regular and.. - Akiyoshi Wakatani (1994) (Correct)
Demand-Driven Interprocedural Constant Propagation.. - Autrey (1994) (Correct)
Optimization of Array Redistribution for Distributed Memory.. - Akiyoshi Wakatani (1995) (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