A parallel version of GPBi-CG method suitable for distributed parallel computing

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 %.

[1]  L.T. Yang,et al.  The improved CGS method for large and sparse linear systems on bulk synchronous parallel architectures , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[2]  Xuebin Chi,et al.  Multiple search direction conjugate gradient method II: theory and numerical experiments , 2004, Int. J. Comput. Math..

[3]  M. B. Van Gijzen,et al.  Fast solution of nonsymmetric linear systems on Grid computers using parallel variants of IDR(s) , 2010 .

[4]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[5]  Martin B. van Gijzen,et al.  IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations , 2008, SIAM J. Sci. Comput..

[6]  L.T. Yang,et al.  The improved BiCGStab method for large and sparse unsymmetric linear systems on parallel distributed memory architectures , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[7]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[8]  Laurence T. Yang,et al.  The improved BiCG method for large and sparse linear systems on parallel distributed memory architectures , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[9]  Zhiqiang Sheng,et al.  An improved bi-conjugate residual algorithm suitable for distributed parallel computing , 2007, Appl. Math. Comput..

[10]  Laurence T. Yang,et al.  The Improved Quasi-minimal Residual Method on Massively Distributed Memory Computers , 1997, HPCN Europe.

[11]  H. V. D. Vorst,et al.  Reducing the effect of global communication in GMRES( m ) and CG on parallel distributed memory computers , 1995 .

[12]  Shao-Liang Zhang,et al.  GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems , 1997, SIAM J. Sci. Comput..

[13]  Liu Jie,et al.  An Improved Conjugate Residual Algorithm for Large Symmetric Linear Systems , 2006 .

[14]  Xing-Ping Liu,et al.  An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing , 2009 .

[15]  H. Martin Bücker,et al.  A Parallel Version of the Quasi-Minimal Residual Method, Based on Coupled Two-Term Recurrences , 1996, PARA.

[16]  R. Freund,et al.  QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .

[17]  Pierre-Alexandre Bliman,et al.  A cooperative conjugate gradient method for linear systems permitting multithread implementation of low complexity , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[18]  Zhiqiang Sheng,et al.  A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments , 2006, Appl. Math. Comput..

[19]  Eric de Sturler,et al.  A Performance Model for Krylov Subspace Methods on Mesh-Based Parallel Computers , 1996, Parallel Comput..

[20]  Tongxiang Gu,et al.  Multiple search direction conjugate gradient method I: methods and their propositions , 2004, Int. J. Comput. Math..

[21]  Laura Grigori,et al.  Communication Avoiding ILU0 Preconditioner , 2015, SIAM J. Sci. Comput..