Minimizing synchronization in IDR (s)

SUMMARY IDR(s) is a family of fast algorithms for iteratively solving large nonsymmetric linear systems. With cluster computing and in particular with Grid computing, the inner product is a bottleneck operation. In this paper, three techniques are investigated for alleviating this bottleneck. First, a recently proposed IDR(s) algorithm that is highly efficient and stable is reformulated in such a way that it has a single global synchronization point per iteration step. Second, the so-called test matrix is chosen so that the work, communication, and storage involving this matrix is minimized in multi-cluster environments. Finally, a methodology is presented for a-priori estimation of the optimal value of s using only problem and machine-based parameters. Numerical experiments applied to a 3D convection–diffusion problem are performed on the DAS-3 Grid computer, demonstrating the effectiveness of our approach. Copyright 2011 John Wiley & Sons, Ltd.

[1]  M. B. Van Gijzen,et al.  An elegant IDR(s) variant that efficiently exploits bi-orthogonality properties , 2010 .

[2]  Seiji Fujino,et al.  An Overview of A Family of New Iterative Methods Based on IDR Theorem And Its Estimation , 2009 .

[3]  Anthony T. Chronopoulos,et al.  s-step iterative methods for symmetric linear systems , 1989 .

[4]  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..

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

[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]  Valeria Simoncini,et al.  Interpreting IDR as a Petrov--Galerkin Method , 2010, SIAM J. Sci. Comput..

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

[9]  Martin H. Gutknecht,et al.  Eigenvalue Computations Based on IDR , 2013, SIAM J. Matrix Anal. Appl..

[10]  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..

[11]  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..

[12]  D. R. Fokkema,et al.  BiCGstab(ell) for Linear Equations involving Unsymmetric Matrices with Complex Spectrum , 1993 .

[13]  Gerard L. G. Sleijpen,et al.  Exploiting BiCGstab(ℓ) Strategies to Induce Dimension Reduction , 2010, SIAM J. Sci. Comput..

[14]  Gerard L. G. Sleijpen,et al.  Bi-CGSTAB as an induced dimension reduction method , 2010 .

[15]  Peter Sonneveld,et al.  On the convergence behaviour of IDR(s) , 2010 .

[16]  Jason Maassen,et al.  Experiences with Fine-Grained Distributed Supercomputing on a 10G Testbed , 2008, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID).

[17]  Leslie G. Valiant.  A Bridging Model for Multi-core Computing , 2008, ESA.

[18]  P. Sonneveld,et al.  IDR(s): A family of simple and fast algorithms for solving large nonsymmetric linear systems , 2007 .

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

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

[21]  M. Gutknecht.  IDR Explained , 2008 .

[22]  Boris I. Krasnopolsky.  The reordered BiCGStab method for distributed memory computer systems , 2010, ICCS.

[23]  Seiji Fujino,et al.  Improved IDR(s) Method for Gaining Very Accurate Solutions , 2009 .

[24]  Peter Sonneveld,et al.  On the statistical properties of solutions of completely random linear systems , 2010 .