Recent Developments in Iterative Methods for Reducing Synchronization
arXiv:1912.00816 · doi:10.1109/DCABES48411.2019.00048
Abstract
On modern parallel architectures, the cost of synchronization among processors can often dominate the cost of floating-point computation. Several modifications of the existing methods have been proposed in order to keep the communication cost as low as possible. This paper aims at providing a brief overview of recent advances in parallel iterative methods for solving large-scale problems. We refer the reader to the related references for more details on the derivation, implementation, performance, and analysis of these techniques.
References in corpus (6)
- The communication-hiding pipelined BiCGStab method for the parallel solution of large unsymmetric linear systems
- Distributed convergence detection based on global residual error under asynchronous iterations
- Pipelined, Flexible Krylov Subspace Methods
- Asynchronous Parareal Algorithm Applied to European Option Pricing
- Asynchronous Communications Library for the Parallel-in-Time Solution of Black-Scholes Equation
- Asynchronous Time-Parallel Method based on Laplace Transform