Symbolic Communication Set Generation for Irregular Parallel Applications |
| |
Authors: | Guo Minyi Pan Yi Liu Zhen |
| |
Affiliation: | (1) Department of Computer Software, The University of Aizu, Aizu-Wakamatsu City, Fukushima, 965–8580, Japan;(2) Department of Computer Science, Georgia State University, University Plaza, Atlanta, GA 30303, USA;(3) Department of Environmental and Culture Sciences, Nagasaki Institute of Applied Science, Abe-machi, Nagasaki, 851-0193, Japan |
| |
Abstract: | Communication set generation significantly influences the performance of parallel programs. However, studies seldom give attention to the problem of communication set generation for irregular applications. In this paper, we propose communication optimization techniques for the situation of irregular array references in nested loops. In our methods, the local array distribution schemes are determined so that the total number of communication messages is minimized. Then, we explain how to support communication set generation at compile-time by introducing some symbolic analysis techniques. In our symbolic analysis, symbolic solutions of a set of symbolic expression are obtained by using certain restrictions. We introduce symbolic analysis algorithms to obtain the solutions in terms of a set of equalities and inequalities. Finally, experimental results on a parallel computer CM-5 are presented to validate our approach. |
| |
Keywords: | parallelizing compilers irregular array references communication optimization symbolic analysis distributed memory multicomputers compile-time optimization |
本文献已被 SpringerLink 等数据库收录! |
|