The swept rule for breaking the latency barrier in time advancing PDEs

JOURNAL OF COMPUTATIONAL PHYSICS

卷:307

Article

Alhubail, Maitham¹  Wang, Qiqi¹ 

[1] MIT, Dept Aeronaut & Astronaut, 77 Massachusetts Ave, Cambridge, MA 02139 USA

关键词: Swept rule;    Numerical solution of PDE;    Latency;    Domain decomposition;    Space-time decomposition;    Parallel computing;   

DOI  :  10.1016/j.jcp.2015.11.026

来源: Elsevier

【 摘 要 】

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. (C) 2015 Elsevier Inc. All rights reserved.

【 授权许可】

Free