An Approach to Optimize Communication for Irregular Array References

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