%0 Journal Article
%T A Communication Optimization Algorithm Based on Data-Flow Analysis of Region Graph<br>基于区域图数据流分析的通信优化算法
%A ZHONG Hong-Tao
%A SHU Ji-Wu
%A WEN Dong-Chan
%A ZHENG Wei-Min
%A <br>钟洪涛
%A 舒继武
%A 温冬婵
%A 郑纬民
%J 软件学报
%D 2003
%I 
%X Reducing communication overhead is extremely important for parallelizing compiler to generate efficient codes for distributed-memory systems. In this paper, a redundant parallel execution model (RPEM) is proposed as an execution model for target programs optimized by the new algorithm. The region graph is introduced, and an effective algorithm is proposed to maximize the regions in the region graph. A region-based data-flow analysis algorithm is proposed to perform communication optimization. The overhead of data-flow analysis can be reduced by performing analysis on the maximized region graph. The coarse grain analysis also helps to communication lift up and aggregation. This communication optimization algorithm is able to perform inter-loop and inter-procedure analysis. Experimental results show that this algorithm is effective in reducing both communication volume and number of messages in programs with a large communication amount.
%K communication optimization
%K data-flow analysis
%K region graph
%K distributed memory system<br>通信优化
%K 数据流分析
%K 区域图
%K 分布存储系统
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=698EFC167975690C&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=0B39A22176CE99FB&sid=A58CF3BAE79427D0&eid=B1F98368A47B8888&journal_id=1000-9825&journal_name=软件学报&referenced_num=3&reference_num=11