Implementation of low-storage Runge-Kutta time integration schemes in scalable asynchronous partial differential equation solvers

Goswami, SK and Matthew, VJ and Aditya, K (2023) Implementation of low-storage Runge-Kutta time integration schemes in scalable asynchronous partial differential equation solvers. In: Journal of Computational Physics, 477 .

PDF jou_com_phy_477_2023.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

The asynchronous computing method based on finite-difference schemes has shown promise in significantly improving the scalability of time-dependent partial differential equation (PDE) solvers by either relaxing data synchronization or avoiding communication between processing elements (PEs) on massively parallel machines. This method uses high-order accurate asynchrony-tolerant (AT) schemes coupled with appropriate time integration schemes to provide the desired accuracy required by high-fidelity solvers such as the direct numerical simulations for fluid flow. For time integration, Runge-Kutta (RK) schemes, particularly the low-storage implementation, are widely used due to their ability to provide good stability properties and be computationally efficient. However, the implementation of AT schemes with multi-stage RK schemes necessitates an over-decomposition of the spatial domain in a parallel setting, leading to increased message sizes for communication and redundant computations. In this paper, we propose a novel method to couple asynchrony-tolerant and low-storage explicit RK schemes in solving time-dependent PDEs that would result in a significant reduction in communications and relaxed synchronizations. We develop new asynchrony-tolerant schemes for ghost or buffer point updates that are necessary to maintain desired order of accuracy. The accuracy of this method is investigated, both theoretically and numerically, using simple one-dimensional linear model equations. Thereafter, we demonstrate the scalability of the proposed numerical method through three-dimensional simulations of decaying Burgers' turbulence, performed using two different asynchronous algorithms: communication-avoiding and synchronization-avoiding algorithms. The scalability studies up to 27,000 cores were found to yield speed-ups up to 6× compared to a baseline synchronous algorithm. Overall, the proposed approach shows the potential to improve the scalability of exascale PDE solvers significantly. © 2023 Elsevier Inc.

Item Type:	Journal Article
Publication:	Journal of Computational Physics
Publisher:	Academic Press Inc.
Additional Information:	The copyright for this article belongs to Academic Press Inc.
Keywords:	Digital storage; Finite difference method; Flow of fluids; Integration; Numerical methods; Partial differential equations; Runge Kutta methods; Stability; Synchronization, Asynchronous computing; Asynchrony; Computing methods; Finite difference scheme; Low-storage; Massive computation; Partial differential equations solver; Runge-kutta schemes; Time-dependent partial differential equations; Time-integration scheme, Scalability
Department/Centre:	Division of Interdisciplinary Sciences > Computational and Data Sciences
Date Deposited:	16 Feb 2023 03:47
Last Modified:	16 Feb 2023 03:47
URI:	https://eprints.iisc.ac.in/id/eprint/80284

Actions (login required)

View Item