Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Scalable Asynchronous Domain Decomposition Solvers

Journal Article · · SIAM Journal on Scientific Computing
DOI:https://doi.org/10.1137/19m1291303· OSTI ID:1769906

We discuss how 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.

Research Organization:
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1769906
Alternate ID(s):
OSTI ID: 1832745
Report Number(s):
SAND--2020-8220J; 689827
Journal Information:
SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 6 Vol. 42; ISSN 1064-8275
Publisher:
SIAMCopyright Statement
Country of Publication:
United States
Language:
English

References (21)

Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines journal January 2013
Synchronous and asynchronous optimized Schwarz methods for one‐way subdivision of bounded domains journal December 2019
Asynchronous Iterative Methods for Multiprocessors journal April 1978
On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy journal July 1989
A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems journal January 1999
Performance of asynchronous optimized Schwarz with one-sided communication journal August 2019
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate journal October 2008
Distributed Convergence Detection Based on Global Residual Error Under Asynchronous Iterations journal April 2018
High Performance RDMA-Based MPI Implementation over InfiniBand journal June 2004
An Algebraic Convergence Theory for Restricted Additive Schwarz Methods Using Weighted Max Norms journal January 2001
Toward Exascale Resilience journal September 2009
A Supernodal Approach to Sparse Partial Pivoting journal January 1999
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs journal January 1998
Restricted Additive Schwarz Preconditioners with Harmonic Overlap for Symmetric Positive Definite Linear Systems journal January 2003
Asynchronous optimized Schwarz methods with and without overlap journal March 2017
s-step iterative methods for symmetric linear systems journal February 1989
On asynchronous iterations journal November 2000
Distributed asynchronous computation of fixed points journal September 1983
ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates journal January 2016
A decentralized convergence detection algorithm for asynchronous parallel iterative algorithms journal January 2005
Chaotic relaxation journal April 1969