Efficient Communication Optimization for Irregular Array References (ハイパフォーマンスコンピューティング研究報告 2001年並列/分散/協調処理に関する『沖縄』サマー・ワークショップ(SWoPP「沖縄」2001)--研究会・連続同時開催)

概要

論文の詳細を見る
Communication set generation significantly influences the performance of parallel programs. However, seldom work gives attention to the communication generation problem for irregular applications. In this paper, we propose some communication optimization techniques for the situation of irregular array references in nest loops. In our methods, the local array disitribution schemes are determined such that the total amount of communication messages is minimum. Then, we explain how to support communication set generation at compile-time 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. Finally, we show experimental results on a parallel computer CM-5 that validate our approach. Keywords : Parallelizing compilers, Irregular array references, Communication optimization, Symbolic analysis, Distributed memory multicomputers.
一般社団法人情報処理学会の論文
2001-07-25