Home > Publications database > Parareal in Julia with Singularity |
Master Thesis | FZJ-2021-00911 |
2020
Please use a persistent id in citations: http://hdl.handle.net/2128/27103
Abstract: In this thesis a Julia version of the parallel-in-time method Parareal is introduced. Parareal decomposes the time as an approach for parallelization. Parareal is an hierarchical, iterative algorithm that uses a coarse, cheap integrator to propagate information quickly forward in time in order to provide initial values for the parallelized original time integration scheme. The problems here used to test the Parareal algorithm are the Lorenz equation, the heat equation and the Allen-Cahn equation. Julia is a programming language that was specifically designed to be used for numerical applications and parallelization. Julia is becoming more popular due to the fact that it is easier to implement than C but has a better runtime than Python. Julia is a new language and not available on most host systems. Singularity is a container solution to create the necessities for scientific application-driven workloads. By using a container the user can configure the environment in which the application can run independently of the host system and its software specifications.This thesis shows how a Singularity container for the Parareal algorithm implemented in Julia can be built. The container is portable to different hosts like HPC and cloud systems without having a runtime overhead in comparison to the runtime without a container.
![]() |
The record appears in these collections: |