The swept rule for breaking the latency barrier in time advancing PDEs
Name
Wang_The swept rule.pdf
Size
2.17 MB
Format
Adobe PDF
Checksum (MD5)
cf1d399117a9f364bfa99c1077dc61d4
Author(s) •
Alhubail, Maitham Makki
Wang, Qiqi
Date Issued
December 2015
Journal
Journal of Computational Physics
Publisher
Elsevier
Citation
Alhubail, Maitham, and Qiqi Wang. “The Swept Rule for Breaking the Latency Barrier in Time Advancing PDEs.” Journal of Computational Physics 307 (February 2016): 110–121.
Version
Original manuscript
Abstract
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 the domain of dependency, making it possible to communicate once per many timesteps without redundant computation. The article presents simple theoretical analysis to the performance of the swept rule which then was shown to be accurate by conducting numerical experiments.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.jcp.2015.11.026