Array dataflow information plays an important role for successful automatic parallelization of Fortran programs. This paper proposes a powerful symbolic array dataflow analysis to support array privatization and loop parallelization for programs with arbitrary control flow graphs and acyclic call graphs. Our scheme summarizes array access information using guarded array regions and propagates such regions over a Hierarchical Supergraph (HSG). The use of guards allows us to use the information in IF conditions to sharpen the array dataflow analysis and thereby to handle difficult cases which elude other existing techniques. The guarded array regions retain the simplicity of set operations for regular array regions in common cases, and they e...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
Compiling for efficient execution on advanced computer architectures requires extensive program anal...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Array dataflow information plays an important role for successful automatic parallelization of Fortr...
Array data-flow analysis is known to be crucial to the success of array privatization, one of the mo...
Array data flow analysis is known to be crucial to the success of array privatization, one of the mo...
Memory-related anti- and output dependences are false dependences because they do not represent the ...
This paper presents a new analysis for parallelizing compilers called predicated array data-flow ana...
To effectively translate real programs written in standard, sequential languages into parallel compu...
International audienceStatic Single Assignment (SSA) has become the intermediate program representat...
In this paper we describe efficient symbolic evaluation techniques to compute the values of variable...
This paper addresses the data-flow analysis of access to arrays in recursive imperative programs. Wh...
Exact array dataflow analysis can be achieved in the general case if the only control structures are...
Data parallel programming languages, such as HPF, are the easiest way to program Distributed Memory ...
Parallelizing compilers are increasingly relying on accurate data dependence information to exploit ...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
Compiling for efficient execution on advanced computer architectures requires extensive program anal...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Array dataflow information plays an important role for successful automatic parallelization of Fortr...
Array data-flow analysis is known to be crucial to the success of array privatization, one of the mo...
Array data flow analysis is known to be crucial to the success of array privatization, one of the mo...
Memory-related anti- and output dependences are false dependences because they do not represent the ...
This paper presents a new analysis for parallelizing compilers called predicated array data-flow ana...
To effectively translate real programs written in standard, sequential languages into parallel compu...
International audienceStatic Single Assignment (SSA) has become the intermediate program representat...
In this paper we describe efficient symbolic evaluation techniques to compute the values of variable...
This paper addresses the data-flow analysis of access to arrays in recursive imperative programs. Wh...
Exact array dataflow analysis can be achieved in the general case if the only control structures are...
Data parallel programming languages, such as HPF, are the easiest way to program Distributed Memory ...
Parallelizing compilers are increasingly relying on accurate data dependence information to exploit ...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
Compiling for efficient execution on advanced computer architectures requires extensive program anal...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...