Linear data distribution based on index analysis

In this chapter, we propose a linear data distribution technique, which extends the traditional BLOCK or CYCLIC distribution for intra-dimension as in HPF, to permit partitioning the array elements along slant lines. The array distribution patterns are determined by analyzing the array subscript references in loop nests. If the data are distributed along the slant lines, then we show the conversion algorithm between global address and local address, and the conversion algorithm from global iteration space to local iteration space.

[1]  Manish Gupta,et al.  Automatic Data Partitioning on Distributed Memory Multicomputers , 1992 .

[2]  Minyi Guo,et al.  Efficient Implementation of Multi-Dimensional Array Redistribution , 1998 .

[3]  Barbara M. Chapman,et al.  Supercompilers for parallel and vector computers , 1990, ACM Press frontier series.

[4]  Michael Wolfe,et al.  High performance compilers for parallel computing , 1995 .

[5]  Ken Kennedy,et al.  A static performance estimator to guide data partitioning decisions , 1991, PPOPP '91.

[6]  Utpal Banerjee,et al.  Loop Transformations for Restructuring Compilers: The Foundations , 1993, Springer US.

[7]  Utpal Banerjee.  Loop Parallelization , 1994, Springer US.

[8]  Minyi Guo,et al.  Improving performance of multi-dimensional array redistribution on distributed memory machines , 1998, Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments.

[9]  Ken Kennedy,et al.  An Interactive Environment for Data Partitioning and Distribution , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[10]  Rice UniversityCORPORATE,et al.  High performance Fortran language specification , 1993 .

[11]  Monica S. Lam,et al.  Global optimizations for parallelism and locality on scalable parallel machines , 1993, PLDI '93.

[12]  J. Ramanujam,et al.  Compile-Time Techniques for Data Distribution in Distributed Memory Machines , 1991, IEEE Trans. Parallel Distributed Syst..

[13]  Keshav Pingali,et al.  Solving Alignment Using Elementary Linear Algebra , 2001, Compiler Optimizations for Scalable Parallel Systems Languages.

[14]  Jang-Ping Sheu,et al.  Communication-Free Data Allocation Techniques for Parallelizing Compilers on Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..

[15]  John A. Chandy,et al.  The Paradigm Compiler for Distributed-Memory Multicomputers , 1995, Computer.

[16]  Monica S. Lam,et al.  Communication optimization and code generation for distributed memory machines , 1993, PLDI '93.

[17]  Manish Gupta,et al.  Compile-time estimation of communication costs on multicomputers , 1992, Proceedings Sixth International Parallel Processing Symposium.

[18]  K. Kennedy,et al.  Automatic Data Layout for High Performance Fortran , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[19]  Manish Gupta.  Automatic data partitioning on distributed memory multicomputers. Ph.D. Thesis , 1992 .

[20]  D.A. Reed,et al.  An Integrated Compilation and Performance Analysis Environment for Data Parallel Programs , 1995, Proceedings of the IEEE/ACM SC95 Conference.