A Symbolic Analysis Method of Communication Set Generation for Irregular Array Reference

Communication set generation significantly influences the performance of parallel programs. However, seldom works gives attention to the communication generation problem for irregular applications. In this paper, we will explain how support to generate communication set for irregular array references in loops. We propose a compile-time algorithm by introducing some symbolic analysis techniques. In our symbolic analysis system, a set of symbolic solutions of a symbolic expression system is solved by limiting some restrictions. For this proposal, we introduce some symbolic analysis algorithms to fix solutions in a system of equalities and inequalities. Finally, we show experimental results on a parallel computer CM-5 that validate our approach.

[1]  Alok Choudhary,et al.  Runtime compilation techniques for data partitioning and communication schedule reuse , 1993, Supercomputing '93.

[2]  Guy L. Steele,et al.  The High Performance Fortran Handbook , 1993 .

[3]  John R. Gilbert,et al.  Generating local addresses and communication sets for data-parallel programs , 1993, PPOPP '93.

[4]  Minyi Guo,et al.  Reducing Communication Cost for Parallelizing Irregular Scientific Codes , 2002, PARA.

[5]  Sandeep K. S. Gupta,et al.  On Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[6]  Ken Kennedy,et al.  Efficient address generation for block-cyclic distributions , 1995, ICS '95.

[7]  Jean-Luc Gaudiot,et al.  Communication Generation for Aligned and Cyclic(K) Distributions Using Integer Lattice , 1999, IEEE Trans. Parallel Distributed Syst..

[8]  Minyi Guo,et al.  Contention-free communication scheduling for array redistribution , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).

[9]  Geoffrey C. Fox,et al.  The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers , 1989, Int. J. High Perform. Comput. Appl..

[10]  Scott B. Baden,et al.  A robust parallel programming model for dynamic non-uniform scientific computations , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[11]  Yunheung Paek,et al.  An Advanced Compiler Framework for Non-Cache-Coherent Multiprocessors , 2002, IEEE Trans. Parallel Distributed Syst..

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

[13]  Prithviraj Banerjee,et al.  Compiler and Run-Time Support for Exploiting Regularity within Irregular Applications , 2000, IEEE Trans. Parallel Distributed Syst..