Performance of asynchronous optimized Schwarz with one-sided communication

Ichitaro Yamazaki, Edmond Chow, Aurelien Bouteiller, Jack Dongarra

Research output: Contribution to journalArticlepeer-review

Abstract

In asynchronous iterative methods on distributed-memory computers, processes update their local solutions using data from other processes without an implicit or explicit global synchronization that corresponds to advancing the global iteration counter. In this work, we test the asynchronous optimized Schwarz domain-decomposition iterative method using various one-sided (remote direct memory access) communication schemes with passive target completion. The results show that when one-sided communication is well-supported, the asynchronous version of optimized Schwarz can outperform the synchronous version even for perfectly balanced partitionings of the problem on a supercomputer with uniform nodes.

Original languageEnglish
Pages (from-to)66-81
Number of pages16
JournalParallel Computing
Volume86
Early online date15 May 2019
DOIs
Publication statusPublished - Aug 2019

Fingerprint

Dive into the research topics of 'Performance of asynchronous optimized Schwarz with one-sided communication'. Together they form a unique fingerprint.

Cite this