Multi-Level Parallel Algorithm to Solve the Eikonal Equation with the Fast Sweeping Method

We present an adaptive domain decomposition strategy to introduce distributed memory parallelism into the fast sweeping algorithm. Efficient parallelization of fast sweeping method (FSM) for shared and/or distributed memory platforms has been an interest for research. The current parallel implementations for FSM has increased its efficiency however, the application depends of the size of the problem and the available memory resources. We introduce a new domain decomposition strategy to extend FSM to distributed memory parallelism with accelerators. Our proposed approach eliminates the limitation to solve large memory problems or large number of processors