A parallel version of GPBi-CG method suitable for distributed parallel computing
A parallel version of GPBi-CG method suitable for distributed parallel computing
复制标题
DOI：
10.1007/s40314-014-0206-z
复制
发表时间：
2014-12
影响因子：
2.6
通讯作者：
Xian-yu Zuo;Li-tao Zhang;T. Gu;Fengcheng Zheng;Ning Li
中科院分区：
文献类型：
--
作者：
Xian-yu Zuo;Li-tao Zhang;T. Gu;Fengcheng Zheng;Ning Li
本文提出了一种新的并行GPBi-CG方法（简称PGPBi-CG方法），用于求解分布式并行环境下具有不对称系数矩阵的大型稀疏线性系统。该方法通过重构GPBi-CG方法，将3个全局同步点减少为1个，内积的通信时间与矢量更新的计算时间有效重叠。它将数值稳定性的要素与并行算法的设计特点相结合。与通信时间的减少相比，其代价只是稍微增加了计算时间，可以忽略不计。性能和等效率分析表明，PGPBi-CG方法比GPBi-CG方法具有更好的并行性和可扩展性。数值实验表明，可扩展性提高了3倍，并行通信性能提高了66.7%。
In this paper, one new parallel version of GPBi-CG method (PGPBi-CG method, in brief) is proposed for solving large sparse linear systems with unsymmetrical coefficient matrices on distributed parallel environments. The method reduces three global synchronization points to one by reconstructing GPBi-CG method and the communication time required for the inner product can be efficiently overlapped with computation time of vector updates. It combines the elements of numerical stability with the characteristics of design of parallel algorithms. The cost is only slightly increased computation time, which can be ignored, compared with the reduction of communication time. Performance and isoefficiency analysis shows that the PGPBi-CG method has better parallelism and scalability than the GPBi-CG method. Numerical experiments show that the scalability can be improved by a factor 3 and the improvement in parallel communication performance approaches 66.7 %.