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

Asynchronous Iterative Solvers for Extreme-Scale Computing

Technical Report ·
DOI:https://doi.org/10.2172/1764239· OSTI ID:1764239
 [1];  [2];  [2]
  1. Univ. of Tennessee, Knoxville, TN (United States); University of Tennessee
  2. Univ. of Tennessee, Knoxville, TN (United States)
The Asynchronous Iterative Solvers for Extreme-Scale Computing (AsyncIS) project aims to explore more efficient numerical algorithms by decreasing their overhead. AsyncIS does this by replacing the outer Krylov subspace solver with an asynchronous optimized Schwarz method, thereby removing the global synchronization and bulk synchronous operations typically used in numerical codes. AsyncIS—a U.S. Department of Energy (DOE)-funded collaboration between Georgia Tech, the University of Tennessee, Knoxville, Temple University, and Sandia National Laboratories—also focuses on the development and optimization of asynchronous preconditioners (i.e., preconditioners that are generated and/or applied in an asynchronous fashion). The novel preconditioning algorithms that provide fine-grained parallelism enable preconditioned Krylov solvers to run efficiently on large-scale distributed systems and manycore accelerators like GPUs.
Research Organization:
Univ. of Tennessee, Knoxville, TN (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
DOE Contract Number:
SC0016513
OSTI ID:
1764239
Report Number(s):
DOE-UTK-DE-SC0016513-1
Country of Publication:
United States
Language:
English

Similar Records

Evaluating asynchronous Schwarz solvers on GPUs
Journal Article · Mon Aug 10 00:00:00 EDT 2020 · International Journal of High Performance Computing Applications · OSTI ID:1778413

Asynchronous Iterative Solvers for Extreme-Scale Computing (Final Report)
Technical Report · Wed Jan 06 23:00:00 EST 2021 · OSTI ID:1756100

Performance of preconditioned iterative solvers in MFiX–Trilinos for fluidized beds
Journal Article · Fri May 18 00:00:00 EDT 2018 · Journal of Supercomputing · OSTI ID:1485815