.png){kind=icon}
.png){kind=icon}
Return
SCALABLE ASYNCHRONOUS DOMAIN DECOMPOSITION SOLVERS
.png){kind=icon}
PRE
AI
DOI：10.1137/19M1291303.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Parallel implementations of linear iterative solvers generally alternate between phases of data exchange and phases of local computation. Increasingly large problem sizes and more heterogeneous compute architectures make load balancing and the design of low latency network interconnects that are able to satisfy the communication requirements of linear solvers very challenging tasks. In particular, global communication patterns such as inner products become increasingly limiting at scale. We explore the use of asynchronous communication based on one-sided Message Passing Interface primitives in the context of domain decomposition solvers. In particular, a scalable asynchronous two-level Schwarz method is presented. We discuss practical issues encountered in the development of a scalable solver and show experimental results obtained on a state-of-the-art supercomputer system that illustrate the benefits of asynchronous solvers in load balanced as well as load imbalanced scenarios. Using the novel method, we can observe speedups of up to four times over its classical synchronous equivalent.
Keywords:
asynchronous iteration
domain decomposition
Schwarz methods
chaotic relaxation
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
View more organizations