The swept rule for breaking the latency barrier in time advancing PDEs
This article investigates the swept rule of space–time domain decomposition, an idea to break the latency barrier via communicating less often when explicitly solving time-dependent PDEs. The swept rule decomposes space and time among computing nodes in ways that exploit the domains of influence and...
Main Authors: | Alhubail, Maitham Makki, Wang, Qiqi |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Published: |
Elsevier
2018
|
Online Access: | http://hdl.handle.net/1721.1/113941 https://orcid.org/0000-0001-9669-2563 |
Similar Items
-
The swept rule for breaking the latency barrier in time-advancing PDEs
by: Alhubail, Maitham Makki(Maitham Makki Hussain)
Published: (2019) -
A thread-based parallel programming library for numerical algorithms
by: Alhubail, Maitham Makki (Maitham Makki Hussain)
Published: (2014) -
Advances in Singular and Degenerate PDEs
by: Salvatore Fragapane
Published: (2022-12-01) -
Barrier Functionals for Output Functional Estimation of PDEs
by: Ahmadi, M, et al.
Published: (2014) -
Simultaneous single-step one-shot optimization with unsteady PDEs
by: Günther, Stefanie, et al.
Published: (2018)