Loading...
Please wait, while we are loading the content...
Interprocedural array alignment analysis.
| Content Provider | CiteSeerX |
|---|---|
| Author | Laure, Erwin Chapman, Barbara |
| Abstract | . The specification of efficient data distribution schemes is one of the major tasks in programming DMMPs with data parallel languages. Although there are no optimal strategies for generating such data distributions, several heuristics have been developed to provide some support to the user. We presented an overview of an automatic alignment analysis tool elsewhere, which is able to automatically generate alignment proposals for the arrays accessed in a procedure and thus simplifies the data distribution problem. In this paper we extend our previous work to interprocedural analysis taking into account dynamic realignment. This feature is essential for applying alignment analysis to real programs. 1 Introduction When migrating applications to distributed memory architectures, data locality is crucial for performance. Under the data parallel programming paradigm, the user must select a distribution of the program's data to the target machine which ensures good data locality and balances... |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Interprocedural Array Alignment Analysis Memory Architecture Account Dynamic Realignment Target Machine Alignment Proposal Data Locality Several Heuristic Data Distribution Problem Interprocedural Analysis Previous Work Efficient Data Distribution Scheme Alignment Analysis Major Task Data Parallel Language Automatic Alignment Analysis Tool Real Program Optimal Strategy Good Data Locality Data Distribution |
| Content Type | Text |
| Resource Type | Article |
