Parallelization in time of numerical simulations of fully-developed plasma turbulence using the parareal algorithm

Authors:
D. Samaddar;D. E. Newman;R. Sánchez
Affiliations:
Department of Physics, University of Alaska Fairbanks, Fairbanks, AK 99775-5920, USA;Department of Physics, University of Alaska Fairbanks, Fairbanks, AK 99775-5920, USA;Fusion Energy Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831-8070, USA
Venue:
Journal of Computational Physics
Year:
2010

Citing 4
Cited 4

Parallel algorithms for initial-value problems for difference and differential equations

Journal of Computational and Applied Mathematics
A time-stepping algorithm for parallel computers

SIAM Journal on Scientific and Statistical Computing
Parallel multiple shooting for the solution of initial value problems

Parallel Computing
Parallel methods for integrating ordinary differential equations

Communications of the ACM

A dependency-driven formulation of parareal: parallel-in-time solution of PDEs as a many-task application

Proceedings of the 2011 ACM international workshop on Many task computing on grids and supercomputers
Event-based parareal: A data-flow based implementation of parareal

Journal of Computational Physics
Mechanisms for the convergence of time-parallelized, parareal turbulent plasma simulations

Journal of Computational Physics
A massively space-time parallel N-body solver

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	31.46

Visualization

Abstract

It is shown that numerical simulations of fully-developed plasma turbulence can be successfully parallelized in time using the parareal algorithm. The result is far from trivial, and even unexpected, since the exponential divergence of Lagrangian trajectories as well as the extreme sensitivity to initial conditions characteristic of turbulence set these type of simulations apart from the much simpler systems to which the parareal algorithm has been applied to this day. It is also shown that the parallel gain obtainable with this method is very promising (close to an order of magnitude for the cases and implementations described), even when it scales with the number of processors quite differently to what is typical for spatial parallelization.