MPI全收集通信的性能优化  

Optimization for Allgather communication of MPI

作　　者：韩颖[1] 刘青昆[1] 杨雷[1] 王佳[1] 

机构地区：[1]辽宁师范大学计算机与信息技术学院,辽宁大连116029

出　　处：《山东理工大学学报（自然科学版）》2010年第5期7-10,共4页Journal of Shandong University of Technology:Natural Science Edition

基　　金：辽宁省博士科研启动基金资助项目(20051058);辽宁省教育厅科研项目(20060479)

摘　　要：通过分析MPI全收集通信四种算法的性能,提出一种将环算法和邻居交换算法相结合的优化算法.优化算法首先执行一步环算法操作,使每个进程都有2个数据,以此来提高通信局部性能;然后调用新邻居交换算法,使每次交换的数据量以2的幂次方递增来减少通信次数.测试结果表明优化算法在长消息通信时的性能较邻居交换算法和环算法的性能优化.当参与通信进程数为2的幂次方时,优化算法的性能达到最佳.Through analyzing the performance of four numbers of MPI_Allgather algorithm,an optimization algorithm combining the ring algorithm and neighbor exchange algorithm is proposed.The optimization algorithm requires the operation of the one-step ring algorithm,which may guarantee two data for each node machine to enhance the communication partial performance.Then,the new neighbor exchange algorithm is used to increase the number of the exchange data in a way of power of 2 to reduce the frequency of the communication.The testing results indicate that the optimization algorithm performs better than either neighbor exchange algorithm or ring algorithm with regard to the long information communication,especially when the number of communications nodes machine is power of 2,the optimization algorithm＇s performance will reach the best.

关 键 词：全收集 组通信 消息传递接口 集群通信 通信优化 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]