Abstract:
Abstract. The property analysis of subscript arrays can be used to facilitate the automatic detection of parallelism in sparse/irregular programs that use indirectly accessed arrays. In order for property analysis to work, array reaching denition information is needed. In this paper, we present a framework to eciently calculate the array reaching denition. This method is designed to handle the common program patterns in real programs. We use some available techniques as the building components, such as data dependence tests and array summary set representations and operations. Our method is more ecient as well as more
exible than the existing techniques. 1
Citations
|
123
|
Automatic Array Privatization
– Tu, Padua
- 1993
|
|
100
|
Direct parallelization of CALL statements
– Triolet, Irigoin, et al.
- 1986
|
|
79
|
ªAn Evaluation of Exact Methods for Analysis of Value-Based Array Data Dependences,º
– Pugh, Wonnacott
- 1993
|
|
78
|
Dataflow Analysis of Scalar and Array References, Intl
– Feautrier
- 1991
|
|
77
|
A technique for summarizing data access and its use in parallelism enhancing transformations
– Balasundaram, Kennedy
- 1989
|
|
57
|
Interprocedural Symbolic Analysis
– HAVLAK
- 1994
|
|
29
|
On the automatic parallelization of sparse and irregular Fortran programs
– Lin, Padua
- 1998
|
|
26
|
An Effectiveness Study of Parallelizing Compiler Techniques
– Eigenmann, Blume
- 1991
|
|
4
|
Structured data analysis for arrays and its use in an optimizing compiler
– Gross, Steenkiste
- 1990
|
|
4
|
Symbolic array data analysis for array privatization and program parallelization
– Gu, Li, et al.
- 1995
|
|
4
|
Simpli of array access patterns for compiler optimizations
– Paek, Hoe, et al.
- 1998
|
|
3
|
Lazy array data- dependence analysis
– Maslov
- 1994
|
|
1
|
Delinearization: An ecient way to break multiloop dependence equations
– Maslov
- 1992
|