Special Issue on LCPC'95 ; 29 pagesInternational audienceMany program optimizations require exact knowledge of the sets of array elements that are referenced in or that flow between state ments or procedures. Some examples are array privatization generation of communications in distributed memory machines or compile time op timization of cache behavior in hierarchical memory machines. Exact array region analysis is introduced in this article. These regions exactly represent the eff ects of statements and procedures upon array variables. To represent the flow of these data we also introduce two new types of array region analyses IN and OUT regions. The intraprocedural propagation is presented as well as a general linear framework for interpr...
this memo is a new loop analysis and transformation technique which brings compiler technology close...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Existing array region representation techniques are sensitive to the complexity of array subscripts....
Abstract. Many program optimizations require exact knowledge of the sets of array elements that are ...
Abstract Many program optimizations require exact knowledge of the sets of array elements that are ...
Array data-flow analysis is known to be crucial to the success of array privatization, one of the mo...
15 pagesInternational audienceAutomatic data transfer generation is a critical step for guided or au...
Array data flow analysis is known to be crucial to the success of array privatization, one of the mo...
The automatic transformation of sequential programs for efficient execution on parallel computers in...
International audienceInterprocedural analyses (IPA) are becoming more and more common in com mercia...
In this article we examine the role played by the interprocedural analysis of array accesses in the ...
ion for Expressing Array Computation Bradford L. Chamberlain E Christopher Lewis Calvin Lin y Law...
Array-OL is a high-level specification language dedicated to the definition of intensive signal proc...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
While the HPCS languages (Chapel, Fortress and X10) have introduced improvements in programmer produ...
this memo is a new loop analysis and transformation technique which brings compiler technology close...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Existing array region representation techniques are sensitive to the complexity of array subscripts....
Abstract. Many program optimizations require exact knowledge of the sets of array elements that are ...
Abstract Many program optimizations require exact knowledge of the sets of array elements that are ...
Array data-flow analysis is known to be crucial to the success of array privatization, one of the mo...
15 pagesInternational audienceAutomatic data transfer generation is a critical step for guided or au...
Array data flow analysis is known to be crucial to the success of array privatization, one of the mo...
The automatic transformation of sequential programs for efficient execution on parallel computers in...
International audienceInterprocedural analyses (IPA) are becoming more and more common in com mercia...
In this article we examine the role played by the interprocedural analysis of array accesses in the ...
ion for Expressing Array Computation Bradford L. Chamberlain E Christopher Lewis Calvin Lin y Law...
Array-OL is a high-level specification language dedicated to the definition of intensive signal proc...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
While the HPCS languages (Chapel, Fortress and X10) have introduced improvements in programmer produ...
this memo is a new loop analysis and transformation technique which brings compiler technology close...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
Existing array region representation techniques are sensitive to the complexity of array subscripts....