(Enter summary)
Abstract: ion for Inner Loop : : : : : : : : : : : : : : : : : : : : : 22
2.3.2 Working through an Example : : : : : : : : : : : : : : : : : : : : : : : : : 26
2.3.3 Profitability of Privatization : : : : : : : : : : : : : : : : : : : : : : : : : : 28
2.3.4 Last Value Assignment : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 30
2.3.4.1 Liveness Analysis : : : : : : : : : : : : : : : : : : : : : : : : : : 30
2.3.4.2 Static and Dynamic Last-Value Assignment : : : : : : : : : : : : 31
2.3.5... (Update)
Cited by: More
The Hyperprocessor: A Template System-on-Chip.. - Karim, Mellan.. (2003)
(Correct)
A Multi-Level Computing Architecture for Embedded.. - Karim, Mellan.. (2004)
(Correct)
Automatically Parallelizing the Main Loops in TFFT2 via Access.. - Hoeflinger (1997)
(Correct)
Similar documents (at the sentence level): More
10.0%: Gated SSA-Based Demand-Driven Symbolic Analysis for.. - Tu, Padua (1995)
(Correct)
8.8%: Efficient Building and Placing of Gating Functions - Tu, Padua (1995)
(Correct)
6.7%: Automatic Array Privatization - Tu (1993)
(Correct)
Active bibliography (related documents): More All
0.7: Automatic Program Parallelization - Banerjee, Eigenmann, Nicolau (1993)
(Correct)
0.4: Unimodular Transformations of Monolithic Array Constructors - V., Gao (1992)
(Correct)
0.4: Privatization and Distribution of Arrays A Preliminary Proposal - Peng Tu
(Correct)
Similar documents based on text: More All
0.7: Restructuring Programs for High-Speed Computers with.. - Blume, Eigenmann.. (1996)
(Correct)
0.3: Cv - Wang
(Correct)
0.3: Program LTRC 2000 22nd Annual Language Testing.. - Theme..
(Correct)
Related documents from co-citation: More All
19: Parallel Programming with Polaris (context) - Blume, Doallo et al. - 1996
12: Symbolic Analysis Techniques for Effective Automatic Parallelization
- Blume - 1995
11: Analysis of interprocedural side effects in a parallel programming environment (context) - Callahan, Kennedy - 1986
BibTeX entry: (Update)
P. Tu. Automatic Array Privatization and Demand-driven Symbolic Analysis. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, May 1995. http://citeseer.ist.psu.edu/article/tu95automatic.html More
@techreport{ tu95automatic,
author = "Peng Tu",
title = "Automatic array privatization and demand-driven symbolic analysis",
number = "UIUCDCS-R-95-1911",
year = "1995",
url = "citeseer.ist.psu.edu/article/tu95automatic.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of the N.. (context) - Garey, Johnson - 1979
1399
Compilers: Principles (context) - Aho, Sethi et al. - 1986
835
High performance fortran language specification
- Fortran - 1993
595
Active messages: a mechanism for integrated communication an..
- von Eicken, Culler et al. - 1992
415
Efficiently computing static single assignment form and the ..
- Cytron, Ferrante et al. - 1991
352
Supercompilers for Parallel and Vector Computers (context) - Zima, Chapman - 1991
299
Dependence Analysis for Supercomputing (context) - Banerjee - 1988
277
Advanced compiler optimizations 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
218
Abstract interpretation and application to logic programs (context) - Cousot, Halbwachs - 1992
202
Distributed shared memory: A survey of issues and algorithms (context) - Nitzberg, Lo - 1991
168
The parallel execution of do loops (context) - Lamport - 1974
168
Compiling programs for distributed-memory multiprocessors (context) - Callahan, Kennedy - 1988
149
An implementation of interprocedural bounded regular section..
- Havlak, Kennedy - 1991
146
Unimodular transformations of double loops (context) - Banerjee - 1990
142
Process decomposition through locality of reference (context) - Rogers, Pingali - 1989
129
Global value numbers and redundant computation (context) - Rosen, Wegman et al. - 1988
122
Superb: A tool for semi-automatic MIMD/SIMD parallelization (context) - Zima, Bast et al. - 1988
119
Detecting equality of variables in programs (context) - Alpern, Wegman et al. - 1988
106
Automatic array privatization
- Tu, Padua - 1993
92
A fast algorithm for finding dominators in a flowgraph (context) - Lengauer, Tarjan - 1979
90
Compiler support for machineindependent parallel programming..
- Hiranandani, Kennedy et al. - 1991
89
Optimizing supercompilers for supercomputers (context) - Wolfe - 1982
87
Analysis of interprocedural side effects in a parallel progr.. (context) - Callahan, Kennedy - 1988
86
The program dependence web: a representation supporting cont.. (context) - Ballance, Maccabe et al. - 1990
84
Experience in the automatic parallelization of four Perfect-..
- Eigenmann, Hoeflinger et al. - 1991
78
An overview of the ptran analysis system for multiprocessing (context) - Allen, Burke et al. - 1988
75
Measuring parallelism in computation-intensive science/engin.. (context) - Kumar - 1988
71
Supercomputer performance evaluation and the perfect benchma..
- Cybenko, Kipp et al. - 1990
68
Beyond induction variables
- Wolfe - 1992
68
Beyond induction variables: Detecting and classifying sequen..
- Gerlek, Stoltz et al.
64
The range test: A dependence test for symbolic (context) - Blume, Eigenmann - 1994
64
Array expansion
- Feautrier - 1988
64
Array privatization for parallel execution of loops
- Li - 1992
61
Dependence-based program analysis
- Johnson, Pingali - 1993
59
the number of operations simultaneously executable in fortra.. (context) - Kuck, Muraoka et al. - 1972
55
A survey of data flow analysis techniques (context) - Kennedy - 1981
53
High-Speed Multiprocessors and Compilation Techniques (context) - Padua, Kuck et al. - 1980
47
A linear time algorithm for finding dominators in flowgraphs.. (context) - Harel - 1985
45
Gated SSA-Based Demand-Driven Symbolic Analysis for Parallel..
- Tu, Padua - 1995
45
Symbolic Dependence Analysis for High-Performance Paralleliz.. (context) - Haghighat, Polychronopoulos - 1991
39
Data dependence and dataflow analysis of arrays
- Maydan, Amarasinghe et al. - 1992
37
Polaris: The next generation in parallelizing compilers
- Blume, Eigenmann et al. - 1994
36
The program structure tree: Computing control regions in lin..
- Johnson, Pearson et al. - 1994
31
Symbolic program analysis and optimization for parallelizing..
- Haghighat, Polychronopoulos - 1992
30
IEEE Transactions on Electronic Computers (context) - Bernstein, programs et al. - 1966
28
Functional Parallelism Theoretical Foundations and Implement.. (context) - Girkar - 1991
28
or the value of renaming for parallelism detection and stora.. (context) - Cytron, Ferante et al. - 1987
26
IEEE Transactions on Software Engineering (context) - Cheatham, Holloway et al. - 1979
25
Automatic recognition of induction variables and recurrence .. (context) - Ammarguellat, Harrison - 1990
25
The program dependency graph and its uses in optimization (context) - Ferrante, Ottenstein et al. - 1987
24
Measurements of Parallelism in Ordinary FORTRAN Programs (context) - Kuck, Budnik et al. - 1974
23
Automatic generation of nested (context) - Burke, Cytron et al. - 1989
23
Construction of thinned gated single-assignment form
- Havlak - 1993
19
Data Dependence in Ordinary Programs (context) - Banerjee - 1976
17
Machine-independent evaluation of parallelizing compilers
- Petersen, Padua - 1992
15
Applications of symbolic evaluation (context) - Clarke, Richardson - 1985
14
Fast algorithm for solving path problems (context) - Tarjan - 1981
13
The HTG: An Intermediate Representation for Programs Based o.. (context) - Girkar, Polychronopoulos - 1992
13
Architectural support of put/get interface for parallelizing.. (context) - Hayashi, Doi et al. - 1994
13
Symbolic analysis techniques needed for the effective parall.. (context) - Blume, Eigenmann - 1994
12
Applications of path compression on balanced trees (context) - Tarjan - 1979
9
MAXPAR: An execution driven simulator for studying parallel .. (context) - Chen - 1989
8
The Delta Program Manipulation system --- Preliminary design (context) - Padua - 1989
8
Computing OE-nodes in linear time using dj-graph (context) - Sreedhar, Gao - 1994
7
Efficient building and placing of gating functions
- Tu, Padua - 1995
6
Theory and Practice (context) - Reingold, Nievergelt et al. - 1977
6
A unified approach to path problems (context) - Tarjan - 1981
6
Subgoal induction (context) - Morris, Wegbreit - 1977
6
Techniques for Improving the Inherent Parallelism in Program.. (context) - Wolfe - 1978
3
Efficient on-line evaluation of functions defined on paths i.. (context) - Farrow - 1977
3
Control and Data Dependence for Program Transformations (context) - Towle - 1976
1
Loop Optimization vs (context) - Wolfe - 1987
1
First Quarterly Report for the Lawrence Livermore Laboratory (context) - Padua - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csrd.uiuc.edu/tech_reports.html): More
Automatic Detection Of Nondeterminacy, And Scalar Optimizations In .. - Ghosh (1992)
(Correct)
Run-time Visualization of Program Data - Tuchman, Jablonowski, Cybenko (1991)
(Correct)
PTOPP - A Practical Toolset for the Optimization of Parallel.. - McClaughry (1992)
(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