Minimizing synchronization in IDR(s).
From MaRDI portal
Publication:2897405
Recommendations
- On the minimal synchronism needed for distributed consensus
- Reducibility of synchronization structures
- Minimal Threshold Separators and Memory Requirements for Synchronization
- Efficient synchronization of multiprocessors with shared memory
- Space-Optimal, Wait-Free Real-Time Synchronization
- Another approach to the implementation of synchronization primitives
- scientific article; zbMATH DE number 1875365
Cites work
- A performance model for Krylov subspace methods on mesh-based parallel computers
- Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
- An improved bi-conjugate residual algorithm suitable for distributed parallel computing
- An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Exploiting BiCGSTAB(\(\ell\)) strategies to induce dimension reduction
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
- Interpreting IDR as a Petrov-Galerkin method
- s-step iterative methods for symmetric linear systems
Cited in
(4)- IDR(s) for solving shifted nonsymmetric linear systems
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- A matrix-free parallel solution method for the three-dimensional heterogeneous Helmholtz equation
- Accelerating the induced dimension reduction method using spectral information
This page was built for publication: Minimizing synchronization in \(\text{IDR}(s)\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897405)