Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
From MaRDI portal
Publication:316448
DOI10.1016/j.camwa.2013.11.008zbMath1381.68019OpenAlexW1971923360MaRDI QIDQ316448
Tong-Xiang Gu, Sheng-Xin Zhu, Xing-Ping Liu
Publication date: 27 September 2016
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2013.11.008
high-performance computingdistributed supercomputersminimizing communicationsparallel Krylov-subspace methods
Related Items (4)
The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR ⋮ Synchronization of a transmission line removal on power networks with positive and negative couplings ⋮ A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems ⋮ Revisiting performance of biCGStab methods for solving systems with multiple right-hand sides
Uses Software
Cites Work
- Unnamed Item
- Reducing Floating Point Error in Dot Product Using the Superblock Family of Algorithms
- A generalization of \(s\)-step variants of gradient methods
- Parallel iterative S-step methods for unsymmetric linear systems
- The block preconditioned conjugate gradient method on vector computers
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- An improved GBPi-CG algorithm suitable for distributed parallel computing
- An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- s-step iterative methods for symmetric linear systems
- GPBiCG(\(m,\ell\)): A hybrid of biCGSTAB and GPBiCG methods with efficiency and robustness
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Reliable updated residuals in hybrid Bi-CG methods
- A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
- Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
- Minimizing synchronization in IDR (s )
- Block s-step Krylov iterative methods
- Minimizing Communication in Numerical Linear Algebra
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Variants of BICGSTAB for Matrices with Complex Spectrum
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Accurate and Efficient Floating Point Summation
- Multiple search direction conjugate gradient method II: theory and numerical experiments
- Multiple search direction conjugate gradient method I: methods and their propositions
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate Sum and Dot Product
This page was built for publication: Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
