OpenMP compiler for distributed memory architectures  

作　　者：WANG Jue , HU ChangJun, ZHANG JiLin & LI JianJiang School of Information and Engineering, University of Science and Technology Beijing, Beijing 100083, China 

出　　处：《Science China(Information Sciences)》2010年第5期932-944,共13页中国科学（信息科学）（英文版）

基　　金：supported by the National High-Tech Research & Development Program of China (Grant Nos. 2006AA01Z105, 2008AA01Z109);the National Natural Science Foundation of China (Grant No. 60373008);the Key Project of Chinese Ministry of Education (Grant Nos. 106019, 108008)

摘　　要：OpenMP is an emerging industry standard for shared memory architectures. While OpenMP has advantages on its ease of use and incremental programming, message passing is today still the most widely-used programming model for distributed memory architectures. How to effectively extend OpenMP to distributed memory architectures has been a hot spot. This paper proposes an OpenMP system, called KLCoMP, for distributed memory architectures. Based on the ＂partially replicating shared arrays＂ memory model, we propose an algorithm for shared array recognition based on the inter-procedural analysis, optimization technique based on the producer/consumer relationship, and communication generation technique for nonlinear references. We evaluate the performance on nine benchmarks which cover computational fluid dynamics, integer sorting, molecular dynamics, earthquake simulation, and computational chemistry. The average scalability achieved by KLCoMP version is close to that achieved by MPI version. We compare the performance of our translated programs with that of versions generated for Omni＋SCASH, LLCoMP, and OpenMP（Purdue）, and find that parallel applications （especially, irregular applications） translated by KLCoMP can achieve more effective performance than other versions.OpenMP is an emerging industry standard for shared memory architectures. While OpenMP has advantages on its ease of use and incremental programming, message passing is today still the most widely-used programming model for distributed memory architectures. How to effectively extend OpenMP to distributed memory architectures has been a hot spot. This paper proposes an OpenMP system, called KLCoMP, for distributed memory architectures. Based on the ＂partially replicating shared arrays＂ memory model, we propose an algorithm for shared array recognition based on the inter-procedural analysis, optimization technique based on the producer/consumer relationship, and communication generation technique for nonlinear references. We evaluate the performance on nine benchmarks which cover computational fluid dynamics, integer sorting, molecular dynamics, earthquake simulation, and computational chemistry. The average scalability achieved by KLCoMP version is close to that achieved by MPI version. We compare the performance of our translated programs with that of versions generated for Omni＋SCASH, LLCoMP, and OpenMP（Purdue）, and find that parallel applications （especially, irregular applications） translated by KLCoMP can achieve more effective performance than other versions.

关 键 词：parallel compiling high performance computing distributed memory architecture OPENMP irregular application 

分 类 号：TP314[自动化与计算机技术—计算机软件与理论]