Scheduling of tasks in the parareal algorithm

Parallelization of partial differential equations (PDEs) by time decomposition has attracted much interest, mainly due to its potential to enable very long time simulations beyond what is possible using spatial domain decomposition. However, there has only been limited performance analysis of the parareal algorithm in the literature, ignoring the efficient scheduling of tasks. This paper presents a detailed study of the scheduling of tasks in the parareal algorithm that achieves significantly better efficiency than the usual algorithm. Two algorithms are proposed, one which uses a manager-worker paradigm with overlap of sequential and parallel phases, and a second that is completely distributed. Experiments were conducted with the 2D heat equation. It was found that the rate of convergence decreases as the number of processors increases, in the case of strong scaling (fixed time interval). However, for weak scaling results the rate of convergence was unaffected by the number of processors. The results of this paper suggest that the parareal algorithm is a promising approach to solving long time evolution problems, particularly when the goal is simulation of longer times using more processors. It also exhibits characteristics that make it particularly suitable for execution on heterogeneous computational grids, such as low communication overhead and easy accommodation of different processor and network speeds.

[1]  Yvon Maday,et al.  The Parareal in Time Iterative Solver: a Further Direction to Parallel Implementation , 2005 .

[2]  Ashok Srinivasan,et al.  Latency tolerance through parallelization of time in scientific applications , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[3]  J. Lions,et al.  Résolution d'EDP par un schéma en temps « pararéel » , 2001 .

[4]  Yvon Maday,et al.  A Parareal in Time Semi-implicit Approximation of the Navier-Stokes Equations , 2005 .

[5]  Charbel Farhat,et al.  Time‐decomposed parallel time‐integrators: theory and feasibility studies for fluid, structure, and fluid–structure applications , 2003 .

[6]  H. H. Rachford,et al.  The Numerical Solution of Parabolic and Elliptic Differential Equations , 1955 .

[7]  Eric Aubanel,et al.  Resource-Aware Load Balancing of Parallel Applications , 2008 .

[8]  Frank Z. Wang,et al.  Handbook of Research on Grid Technologies and Utility Computing: Concepts for Managing Large-Scale Applications , 2009 .

[9]  Jose C. F. Pereira,et al.  Parallel-in-Time Simulation of Two-Dimensional, Unsteady, Incompressible Laminar Flows , 2006 .

[10]  Elena Celledoni,et al.  Norges Teknisk-naturvitenskapelige Universitet Parallelization in Time for Thermo-viscoplastic Problems in Extrusion of Aluminium Parallelization in Time for Thermo-viscoplastic Problems in Extrusion of Aluminium , 2022 .

[11]  Wolfgang Hackbusch,et al.  Parabolic multi-grid methods , 1985 .

[12]  Cornelis W. Oosterlee,et al.  Multigrid Schemes for Time-Dependent Incompressible Navier-Stokes Equations , 1993, IMPACT Comput. Sci. Eng..

[13]  Y Maday,et al.  Parallel-in-time molecular-dynamics simulations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Marc Massot,et al.  Symplectic multi-time step parareal algorithms applied to molecular dynamics , 2009 .

[15]  Ashok Srinivasan,et al.  Latency tolerance through parallelization of time in scientific applications , 2005, Parallel Comput..

[16]  Martin J. Gander,et al.  Analysis of the Parareal Time-Parallel Time-Integration Method , 2007, SIAM J. Sci. Comput..

[17]  Charbel Farhat,et al.  Time‐parallel implicit integrators for the near‐real‐time prediction of linear structural dynamic responses , 2006 .

[18]  Yvon Maday,et al.  The parareal in time algorithm , 2008 .