Recent Developments in Iterative Methods for Reducing Synchronization

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

Full description

Saved in:
Bibliographic Details
Published in:International Symposium on Distributed Computing and Applications to Business, Engineering & Science (Online) pp. 163 - 166
Main Authors: Zou, Qinmeng, Magoules, Frederic
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2019
Subjects:
asynchronous-iterations
Bandwidth
communication-avoiding-algorithms
Convergence
Iterative methods
Linear systems
pipelined-Krylov-subspace-methods
Program processors
s-step-iterative-methods
Sparse matrices
Synchronization
ISSN:2473-3636
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2473-3636
DOI:10.1109/DCABES48411.2019.00048