# Parareal

Parareal is a parallel algorithm from numerical analysis and used for the solution of initial value problems. It was introduced in 2001 by Lions, Maday and Turinici. Since then, it has become one of the most widely studied parallel-in-time integration methods.

## Parallel-in-time integration methods

In contrast to e.g. Runge-Kutta or multi-step methods, some of the computations in Parareal can be performed in parallel and Parareal is therefore one example of a parallel-in-time integration method. While historically most efforts to parallelize the numerical solution of partial differential equations focussed on the spatial discretization, in view of the challenges from exascale computing, parallel methods for temporal discretization have been identified as a possible way to increase concurrency in numerical software. Because Parareal computes the numerical solution for multiple time steps in parallel, it is categorized as a parallel across the steps method. This is in contrast to approaches using parallelism across the method like parallel Runge-Kutta or extrapolation methods, where independent stages can be computed in parallel or parallel across the system methods like waveform relaxation.

## History

Parareal can be derived as both a multigrid method in time method or as multiple shooting along the time axis. Both ideas, multigrid in time as well as adopting multiple shooting for time integration, go back to the 1980s and 1990s. Parareal is a widely studied method and has been used and modified for a range of different applications. Ideas to parallelize the solution of initial value problems go back even further: the first paper proposing a parallel-in-time integration method appeared in 1964.

## Algorithm
### The Problem

The goal is to solve an initial value problem of the form
${\frac {\mathrm {d} u}{\mathrm {d} t}}=f(t,u)\quad {\text{over}}\quad t\in [t_{0},T]\quad {\text{with}}\quad u(t_{0})=u^{0}.$
The right hand side $f$ is assumed to be a smooth (possibly nonlinear) function. It can also correspond to the spatial discretization of a partial differential equation in a method of lines approach. We wish to solve this problem on a temporal mesh of $N+1$ equally spaced points $(t_{0},t_{1},\ldots ,t_{N})$, where $t_{j+1}=t_{j}+\Delta T$ and $\Delta T=(T-t_{0})/N$. Carrying out this discretisation we obtain a partitioned time interval consisting of time slices $[t_{j},t_{j+1}]$ for $j=0,\ldots ,N-1$.
The objective is to calculate numerical approximations $U_{j}$ to the exact solution $u(t_{j})$ using a serial time-stepping method (e.g. Runge-Kutta) that has high numerical accuracy (and therefore high computational cost). We refer to this method as the fine solver ${\mathcal {F}}$, which propagates an initial value $U_{j}$ at time $t_{j}$ to a terminal value $U_{j+1}$ at time $t_{j+1}$. The goal is to calculate the solution (with high numerical accuracy) using ${\mathcal {F}}$ such that we obtain
$U_{j+1}={\mathcal {F}}(t_{j},t_{j+1},U_{j}),\quad {\text{where}}\quad U_{0}=u^{0}.$
The problem with this (and the reason for attempting to solve in parallel in the first place) solution is that it is computationally infeasible to calculate in real-time.

### How it works

Instead of using a single processor to solve the initial value problem (as is done with classical time-stepping methods), Parareal makes use of $N$ processors. The aim to is to use $N$ processors to solve $N$ smaller initial value problems (one on each time slice) in parallel. For example, in a MPI based code, $N$ would be the number of processes, while in an OpenMP based code, $N$ would be equal to the number of threads.
Parareal makes use of a second time-stepping method to solve this initial value problem in parallel, referred to as the coarse solver ${\mathcal {G}}$. The coarse solver works the same way as the fine solver, propagating an initial value over a time interval of length $\Delta T$, however it does so at much lower numerical accuracy than ${\mathcal {F}}$ (and therefore at much lower computational cost). Having a coarse solver that is much less computationally expensive than the fine solver is the key to achieving parallel speed-up with Parareal.
Henceforth, we will denote the Parareal solution at time $t_{j}$ and iteration $k$ by $U_{j}^{k}$.

#### Zeroth Iteration

Firstly, run the coarse solver serially over the entire time interval $[t_{0},T]$ to calculate an approximate initial guess to the solution:
$U_{j+1}^{0}={\mathcal {G}}(t_{j},t_{j+1},U_{j}^{0}),\quad j=0,\ldots ,N-1.$

#### Subsequent Iterations

Next, run the fine solver on each of the time slices, in parallel, from the most up-to-date solution values:
${\mathcal {F}}(t_{j},t_{j+1},U_{j}^{k-1}),\quad j=0,\ldots ,N-1.$
Now update the parareal solution values sequentially using the predictor-corrector:
$U_{j+1}^{k}={\mathcal {G}}(t_{j},t_{j+1},U_{j}^{k})+{\mathcal {F}}(t_{j},t_{j+1},U_{j}^{k-1})-{\mathcal {G}}(t_{j},t_{j+1},U_{j}^{k-1}),\quad j=0,\ldots ,N-1.$
At this stage, one can use a stopping criterion to determine whether the solution values are no longer changing each iteration. For example, one may test this by checking if
$|U_{j}^{k}-U_{j}^{k-1}|<\varepsilon \quad \forall \ j\leq N,$
and some tolerance $\varepsilon >0$. If this critertion is not satisfied, subsequent iterations can then be run by applying the fine solver in parallel and then the predictor-corrector. Once the criterion is satisfied, however, the algorithm is said to have converged in $k\leq N$ iterations. Note that other stopping criterion do exist and have been successfully tested in Parareal.

#### Remarks

Parareal should reproduce the solution that is obtained by the serial application of the fine solver and will converge in a maximum of $N$ iterations. For Parareal to provide speedup, however, it has to converge in a number of iterations significantly smaller than the number of time slices, i.e. $k\ll N$.
In the Parareal iteration, the computationally expensive evaluation of ${\mathcal {F}}(t_{j},t_{j+1},U_{j}^{k-1})$ can be performed in parallel on $N$ processing units. By contrast, the dependency of $U_{j+1}^{k}$ on ${\mathcal {G}}(t_{j},t_{j+1},U_{j}^{k})$ means that the coarse correction has to be computed in serial order.
Typically, some form of Runge-Kutta method is chosen for both coarse and fine integrator, where ${\mathcal {G}}$ might be of lower order and use a larger time step than ${\mathcal {F}}$. If the initial value problem stems from the discretization of a PDE, ${\mathcal {G}}$ can also use a coarser spatial discretization, but this can negatively impact convergence unless high order interpolation is used.

### Speedup

Under some assumptions, a simple theoretical model for the speedup of Parareal can be derived. Although in applications these assumptions can be too restrictive, the model still is useful to illustrate the trade offs that are involved in obtaining speedup with Parareal.
First, assume that every time slice $[t_{j},t_{j+1}]$ consists of exactly $N_{f}$ steps of the fine integrator and of $N_{c}$ steps of the coarse integrator. This includes in particular the assumption that all time slices are of identical length and that both coarse and fine integrator use a constant step size over the full simulation. Second, denote by $\tau _{f}$ and $\tau _{c}$ the computing time required for a single step of the fine and coarse methods, respectively, and assume that both are constant. This is typically not exactly true when an implicit method is used, because then runtimes vary depending on the number of iterations required by the iterative solver.
Under these two assumptions, the runtime for the fine method integrating over $P$ time slices can be modelled as
$c_{\text{fine}}=PN_{f}\tau _{f}.$
The runtime of Parareal using $P$ processing units and performing $k$ iterations is
$c_{\text{parareal}}=(k+1)PN_{c}\tau _{c}+kN_{f}\tau _{f}.$
Speedup of Parareal then is
$S_{p}={\frac {c_{\text{fine}}}{c_{\text{parareal}}}}={\frac {1}{(k+1){\frac {N_{c}}{N_{f}}}{\frac {\tau _{c}}{\tau _{f}}}+{\frac {k}{P}}}}\leq \min \left\{{\frac {N_{f}\tau _{f}}{N_{c}\tau _{c}}},{\frac {P}{k}}\right\}.$
These two bounds illustrate the trade off that has to be made in choosing the coarse method: on the one hand, it has to be cheap and/or use a much larger time step to make the first bound as large as possible, on the other hand the number of iterations $k$ has to be kept low to keep the second bound large. In particular, Parareal's parallel efficiency is bounded by
$E_{p}={\frac {S_{p}}{P}}\leq {\frac {1}{k}},$
that is by the inverse of the number of required iterations.

### Instability for imaginary eigenvalues

The vanilla version of Parareal has issues for problems with imaginary eigenvalues. It typically only converges toward the very last iterations, that is as $k$ approaches $N$, and the speedup $S_{p}$ is always going to be smaller than one. So either the number of iterations is small and Parareal is unstable or, if $k$ is large enough to make Parareal stable, no speedup is possible. This also means that Parareal is typically unstable for hyperbolic equations. Even though the formal analysis by Gander and Vandewalle covers only linear problems with constant coefficients, the problem also arises when Parareal is applied to the nonlinear Navier–Stokes equations when the viscosity coefficient becomes too small and the Reynolds number too large. Different approaches exist to stabilise Parareal, one being Krylov-subspace enhanced Parareal.

## Variants

There are multiple algorithms that are directly based or at least inspired by the original Parareal algorithm.

### Krylov-subspace enhanced Parareal

Early on it was recognised that for linear problems information generated by the fine method ${\mathcal {F}}_{\delta t}$ can be used to improve the accuracy of the coarse method ${\mathcal {G}}_{\Delta t}$. Originally, the idea was formulated for the parallel implicit time-integrator PITA, a method closely related to Parareal but with small differences in how the correction is done. In every iteration $k$ the result ${\mathcal {F}}_{\delta t}(U_{j}^{k})$ is computed for values $u_{j}^{k}\in \mathbb {R} ^{d}$ for $j=0,\ldots ,N-1$. Based on this information, the subspace
$S_{k}:=\left\{U_{j}^{k'}:0\leq k'\leq k,j=0,\ldots ,N-1\right\}$
is defined and updated after every Parareal iteration. Denote as $P_{k}$ the orthogonal projection from $\mathbb {R} ^{d}$ to $S_{k}$. Then, replace the coarse method with the improved integrator ${\mathcal {K}}_{\Delta t}(u)={\mathcal {F}}_{\delta t}(P_{k}u)+{\mathcal {G}}_{\Delta t}((I-P_{k})u)$.
As the number of iterations increases, the space $S_{k}$ will grow and the modified propagator ${\mathcal {K}}_{\Delta t}$ will become more accurate. This will lead to faster convergence. This version of Parareal can also stably integrate linear hyperbolic partial differential equations. An extension to nonlinear problems based on the reduced basis method exists as well.

### Hybrid Parareal spectral deferred corrections

A method with improved parallel efficiency based on a combination of Parareal with spectral deferred corrections (SDC) has been proposed by M. Minion. It limits the choice for coarse and fine integrator to SDC, sacrificing flexibility for improved parallel efficiency. Instead of the limit of $1/k$, the bound on parallel efficiency in the hybrid method becomes
$E_{p}\leq {\frac {k_{s}}{k_{p}}}$
with $k_{s}$ being the number of iterations of the serial SDC base method and $k_{p}$ the typically greater number of iterations of the parallel hybrid method. The Parareal-SDC hybrid has been further improved by addition of a full approximation scheme as used in nonlinear multigrid. This led to the development of the parallel full approximation scheme in space and time (PFASST). Performance of PFASST has been studied for PEPC, a Barnes-Hut tree code based particle solver developed at Juelich Supercomputing Centre. Simulations using all 262,144 cores on the IBM BlueGene/P system JUGENE showed that PFASST could produce additional speedup beyond saturation of the spatial tree parallelisation.

### Multigrid reduction in time (MGRIT)

The multigrid reduction in time method (MGRIT) generalises the interpretation of Parareal as a multigrid-in-time algorithms to multiple levels using different smoothers. It is a more general approach but for a specific choice of parameters it is equivalent to Parareal. The XBraid library implementing MGRIT is being developed by Lawrence Livermore National Laboratory.

### ParaExp

ParaExp uses exponential integrators within Parareal. While limited to linear problems, it can produce almost optimal parallel speedup.