Hybrid Synchronous-Asynchronous Parallel Computing

From the very beginning of parallel numerical computing, its major difficulty consists in achieving highly scaling solvers.This is due to its inherent synchronization phases, which are required after each iteration in traditional iterative computing.Asynchronous iterative computing early arose to overcome such a restriction, which makes it an attractive approach towards high performance computing.Nevertheless, asynchronous convergence is guaranteed so far for relaxation methods only, which do not provide the highest convergence rates in many situations.Efforts to achieve more competitive asynchronous solvers include their design within domain decomposition frameworks and, recently, with coarse-grid correction.We propose here a new formulation of asynchronous additive coarse-grid correction, which allows for convergence conditions independent of communications delays.Our approach is based on a two-splitting formulation of the two-level solver, leading to a hybrid synchronousasynchronous method where asynchronous iterations are combined in parallel with synchronous ones.This possibly paves the way to asynchronous convergence acceleration using quite effective relaxation coefficients obtained from synchronized data.

Authors

Institutions

Publication Details

Journal
Civil-comp conferences
Published
2024-08-26
DOI
https://doi.org/10.4203/ccc.8.5.3
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hybrid Synchronous-Asynchronous Parallel Computing

G. Gbikpi-Benissan, Frédéric Magoulès
Civil-comp conferences
Parallel Computing and Optimization Techniques
article

Hybrid Synchronous-Asynchronous Parallel Computing

G. Gbikpi-Benissan, Frédéric Magoulès
article en

Abstract

From the very beginning of parallel numerical computing, its major difficulty consists in achieving highly scaling solvers.This is due to its inherent synchronization phases, which are required after each iteration in traditional iterative computing.Asynchronous iterative computing early arose to overcome such a restriction, which makes it an attractive approach towards high performance computing.Nevertheless, asynchronous convergence is guaranteed so far for relaxation methods only, which do not provide the highest convergence rates in many situations.Efforts to achieve more competitive asynchronous solvers include their design within domain decomposition frameworks and, recently, with coarse-grid correction.We propose here a new formulation of asynchronous additive coarse-grid correction, which allows for convergence conditions independent of communications delays.Our approach is based on a two-splitting formulation of the two-level solver, leading to a hybrid synchronousasynchronous method where asynchronous iterations are combined in parallel with synchronous ones.This possibly paves the way to asynchronous convergence acceleration using quite effective relaxation coefficients obtained from synchronized data.

Civil-comp conferencesVol. 8
Université Paris-Saclay (FR), CentraleSupélec (FR), University of Pecs (HU)
Openalex Percentile: Top 82%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.