|
|||||
|
|
An improved GPBi-CG algorithm suitable for distributed parallel computing |
|
| Authors: | Xian-yu Zuo Ze-yao Mo |
| Institution: | a Graduate School of Chinese Academy of Engineering Physics, P.O. Box 2101, Beijing 100088, PR China b Laboratory of Computational Physics, Institute of Applied Physics and Computational Mathematics, P.O. Box 8009, Beijing 100088, PR China c Center of High Performance Computing, Institute of Applied Physics and Computational Mathematics, P.O. Box 8009, Beijing 100088, PR China |
| Abstract: | An improved generalized product-type bi-conjugate gradient (GPBi-CG) method (IGPBi-CG method, in brief) for solving large sparse linear systems with unsymmetrical coefficient matrices is proposed for distributed parallel environments. The method reduces three global synchronization points to two by reconstructing GPBi-CG method and the communication time required for the inner product can be efficiently overlapped with useful computation. The cost is only slightly increased computation time, which can be ignored compared with the reduction of communication time. Performance and isoefficiency analysis show that the IGPBi-CG method has better parallelism and scalability than the GPBi-CG method. Numerical experiments show that the scalability can be improved by a factor greater than 1.5 and the improvement in parallel communication performance approaches 33.3˙%. |
| Keywords: | IGPBi-CG method Krylov subspace Sparse unsymmetrical linear systems Global communication Distributed parallel environments |
| 本文献已被 ScienceDirect 等数据库收录！ | |