Download:
|
by Sungdo Moon, Mary W. Hall, Brian R. Murphy
In Proceedings of the 1998 ACM International Conference on Supercomputing
http://suif.stanford.edu/~brm/papers/ics98.ps.gz
Add To MetaCart
Abstract:
This paper presents a new analysis for parallelizing compilers called predicated array data-flow analysis, whereby array dataflow analysis for parallelization and privatization is extended to associate predicates with data-flow values. These predicates can be used to derive conditions under which dependences can be eliminated or privatization is possible. These conditions, which can consist of arbitrary program statements, can be used both to enhance compile-time analysis and to introduce run-time tests that guard safe execution of a parallelized version of a computation. We have implemented predicated array data-flow analysis in the Stanford SUIF compiler. We describe features of the implementation and present experimental results that demonstrate this analysis improves the performance of three programs from the SPEC95FP benchmark suite. 1
Citations
|
289
|
Constant propagation with conditional branches
– Wegman, Zadeck
- 1991
|
|
163
|
The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization
– Rauchwerger, Padua
- 1995
|
|
119
|
Run-Time Parallelization and Scheduling of Loops
– Saltz, Mirchandaney, et al.
- 1991
|
|
103
|
Symbolic Analysis for Parallelizing Compilers
– Haghighat, Polychronopoulos
- 1996
|
|
74
|
Eliminating false data dependences using the Omega test
– Pugh, Wonnacott
- 1992
|
|
49
|
Automatic Array Privatization and Demand-Driven Symbolic Analysis
– Tu
- 1995
|
|
44
|
Extending Typestate Checking Using Conditional Liveness Analysis
– STROM, YELLIN
- 1993
|
|
36
|
Interprocedural Analysis for Parallelization
– Hall, Murphy, et al.
- 1995
|
|
33
|
Qualified data flow problems
– Holley, Rosen
- 1981
|
|
32
|
Interprocedural analyses for programming environments
– Irigoin
- 1992
|
|
27
|
Parallelizing Compiler Techniques Based on Linear Inequalities
– Amarasinghe
- 1997
|
|
23
|
Symbolic Analysis Techniques for Effective Automatic Parallelization
– Blume
- 1995
|
|
20
|
Experience with efficient array data flow analysis for array privatization
– Gu, Li, et al.
- 1997
|
|
9
|
Practical techniques to augment dependence analysis in the presence of symbolic terms
– Goff
- 1992
|
|
6
|
Expected forms of data flow analysis
– Nielson
- 1986
|
|
2
|
Systematic design of program anaysis frameworks
– Cousot, Cousot
- 1979
|
