Efficient Implementation of a Multi-Level Parallel in Time Algorithm
A strategy for scheduling the communication between processors in a multi-level parallel-in-time algorithm to reduce blocking communication is presented. The particular time-parallel method examined is the parallel full approximation scheme in space and time (PFASST), which utilizes a hierarchy of spatial and temporal discretization levels. By decomposing the update to initial conditions passed between processors into multiple spatial resolutions, the communication at the finest level can be scheduled to overlap with computation at coarser levels. The potential cost savings is demonstrated with a three dimensional PDE example.
- 7.Minion, M.L., Williams, S.A.: Parareal and Spectral Deferred Corrections. In: Simos, T.E., Tsitouras, C. (eds.) American Institute of Physics Conference Series vol. 1048, pp. 388–391 (2008). doi:10.1063/1.2990941Google Scholar