Automatic communication code generation in parallel compilation system
The paper introduces computation decomposition and dependence relation in parallel compilation, and presents how to generate communication code automatically according to data and computation decomposition as well as dependence relation. The communication code consists of four parts: data distribution, communication before computation, synchronization communication, and data gathering. By founding different linear inequalities system and using FME method, we can create communication loop nest and insert MPI send and receive code into the loop nest.One linear inequalities system, used to create the code of data distribution and data gathering, is made up of data decomposition and the bound of the array. Another linear inequalities system, used to create the communication code before computation and the synchronization communication code, is made up of computation and data decomposition,data dependence relation, and the bound of iteration. This paper also presents several methods of communication optimization.
parallel compilation linear inequalities system code generation LWT communication optimization
Xue-rong GONG Yong-hong SHENG Ping ZHANG Lin-sheng LU
National Digital Switching System Engineering &Technological R&D Center Zhengzhou, Henan CHINA Jiangnan Institute of Computing Technology Wuxi, Jiangsu CHINA
国际会议
杭州
英文
184-188
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）