William Joseph Blume  @ NUS Home/Search
Context Related
| uiuc.edu/publications/1433.pdf Cached: PS.gz PS PDF Image Update Help From: uiuc.edu/publicationsb1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: interpretation [16] is used to compute the ranges for variables at eachpoint of a program unit. That 55 is, the algorithm "executes" the program byfollowing the control flow paths of the program, updating the current ranges to reflect the side effects of the statements encountered along these paths, until a fixed pointisreached. (Update)
Cited by: More
Access Regions: - Toward Powerful Parallelizing (Correct)
Parallelization of Benchmarks for Scalable.. - Paek, Navarro.. (1998) (Correct)
Simplification of Array Access Patterns for Compiler.. - Paek, Hoeflinger, Padua (1994) (Correct)
Similar documents (at the sentence level): More
12.0%: Symbolic Range Propagation - Blume, Eigenmann (1995) (Correct)
11.9%: Non-Linear and Symbolic Data Dependence Testing - Blume, Eigenmann (1998) (Correct)
11.2%: Demand-driven, Symbolic Range Propagation - Blume, Eigenmann (1995) (Correct)
Active bibliography (related documents): More All
1.8: Symbolic Analysis Techniques For Effective Automatic Parallelization - Blume (1995) (Correct)
0.4: An Overview Of Symbolic Analysis Techniques Needed For The.. - Blume, Eigenmann (1994) (Correct)
0.4: An Overview of Symbolic Analysis Techniques Needed for the.. - Blume, Eigenmann (1994) (Correct)
Similar documents based on text: More All
0.4: Success And Limitations In Automatic Parallelization Of The.. - Blume (1992) (Correct)
0.3: Theory, Techniques, And Experiments In Solving Recurrences In.. - Pottenger (1997) (Correct)
0.2: On the Automatic Parallelization of the Perfect.. - Eigenmann, Hoeflinger.. (1998) (Correct)
Related documents from co-citation: More All
12: Automatic Array Privatization and Demand-driven Symbolic Analysis - Tu - 1995
11: A practical algorithm for exact array dependence analysis (context) - Pugh - 1992
10: Parallel programming in Split-C - Culler - 1993
BibTeX entry: (Update)
W. J. Blume. Symbolic Analysis Techniques for Effective Automatic Parallelization. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, June 1995. http://citeseer.comp.nus.edu.sg/658073.html More
@misc{ blume95symbolic,
author = "W. Blume",
title = "Symbolic Analysis Techniques for Effective Automatic Parallelization",
text = "W. J. Blume. Symbolic Analysis Techniques for Effective Automatic Parallelization.
PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign,
June 1995.",
year = "1995",
url = "citeseer.comp.nus.edu.sg/658073.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
430 Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1985
415 Efficiently Computing Static Single AssignmentForm and the C.. - Cytron, Ferrante et al. - 1991
352 Supercompilers for Parallel and Vector Computers (context) - Zima, Chapman - 1991
299 DependenceAnalysis for Supercomputing (context) - Banerjee - 1988
277 Advanced Compiler Optimization for Supercomputers (context) - Padua, Wolfe - 1986
250 Automatic Discovery of Linear Restraints Among Variables of .. - Cousot, Halbwachs - 1978
232 Constant Propagation with Conditional Branches (context) - Wegman, Zadeck - 1991
217 The Perfect Club Benchmarks: EffectivePerformance Evalution .. - Berry, Chen et al. - 1989
164 A Practical Algorithm for Exact Array Dependence Analysis (context) - Pugh - 1992
111 Automatic Program Parallelization - Banerjee, Eigenmann et al. - 1993
106 Automatic ArrayPrivatization - Tu, Padua - 1993
94 Performance Analysis of Parallelizing Compilers on the Perfe.. (context) - Blume, Eigenmann - 1992
84 Efficient and exact data dependence analysis (context) - Maydan, Hennessy et al. - 1991
84 Experience in the Automatic Parallelization of Four Perfect-.. - Eigenmann, Hoeflinger et al. - 1991
71 Data Dependence and its Application to Parallel Processing (context) - Wolfe, Banerjee - 1987
68 Beyond induction variables - Wolfe - 1992
66 Interprocedural Constant Propagation (context) - Callahan, Cooper et al. - 1986
59 Compiler Analysis of the Value Ranges for Variables (context) - Harrison - 1977
55 Abstract Debugging of Higher-Order Imperative Languages (context) - Bourdoncle - 1993
51 Polaris: A New-Generation Parallelizing Compiler for MPP's - Padua, Eigenmann et al. - 1993
47 A linear time algorithm for finding dominators in a flow gra.. (context) - Harel
45 Idiom Recognition in the Polaris Parallelizing Compiler - Pottenger, Eigenmann - 1995
45 Symbolic Dependence Analysis for High-Performance Paralleliz.. (context) - Haghighat, Polychronopoulos - 1991
40 Interprocedural Symbolic Analysis - Havlak - 1994
37 The Polaris Internal Representation - Faigin, Hoeflinger et al. - 1994
37 Polaris: The Next Generation in Parallelizing Compilers - Blume, Eigenmann et al. - 1994
36 Automatic Detection of Parallelism: A Grand Challenge for Hi.. (context) - Blume, Eigenmann et al. - 1994
34 A Theory of Loop Permutations (context) - Banerjee - 1990
31 Restructuring Fortran Programs for Cedar - Eigenmann, Hoeflinger et al. - 1993
31 Symbolic Program Analysis and Optimization for Parallelizing.. - Haghighat, Polychronopoulos - 1992
26 IEEE Transactions on Software Engineering (context) - Jr, Holloway et al. - 1979
24 Delinearization: An EfficientWay to Break Multiloop Dependen.. - Maslov - 1992
24 An Effectiveness Study of Parallelizing Compiler Techniques (context) - Eigenmann, Blume - 1991
23 A Simple Algorithm for Global Data Flow Analysis Problems (context) - Hecht, Ullman - 1975
22 On Fourier's Analysis of Linear Inequality Systems (context) - Duffin - 1974
19 Goal-Directed Interprocedural Optimization (context) - Briggs, Cooper et al. - 1990
19 of Illinois at Urbana-Champaign (context) - Eigenmann, Hoeflinger et al. - 1992
13 Symbolic Analysis for Parallelizing Compilers - Haghighat - 1994
11 Demand-Driven Symbolic Analysis (context) - Tu, Padua - 1994
11 Dependence Analysis of Arrays Subscripted by Index Arrays (context) - McKinley - 1991
9 Run-Time Dependence Testing byInteger Sequence Analysis - Hoeflinger - 1992
9 Gated SSA-Based Demand-Driven Symbolic Analysis for Parallel.. - Padua - 1995
8 Triangular Banerjee's Inequalities with Directions (context) - Wolfe - 1992
8 Symbolic Analysis: A Basis for Paralleliziation (context) - Haghighat, Polychronopoulos - 1993
7 Fourier's method of Linear Programming and its Dual (context) - Williams - 1986
7 Success and Limitations in Automatic Parallelization of the .. (context) - Blume - 1992
5 and David Wonnacott (context) - Kelly, Maslov et al. - 1995
3 Practical Dependence Testing (context) - Goff, Kennedy et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://polaris.cs.uiuc.edu/publications-b1.html): More
Non-Linear and Symbolic Data Dependence Testing - Blume, Eigenmann (1996) (Correct)
Run-Time Methods for Parallelizing Partially Parallel Loops - Rauchwerger, Amato, Padua (1995) (Correct)
The LRPD Test: Speculative Run-Time Parallelization of.. - Rauchwerger, Padua (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.