Name
Abstract | ||
|---|---|---|
The semi-ordered fast iterative method is used to compute a monotone front propagation of anisotropic nature by solving the eikonal equation. Compared to established iterative methods, such as the fast iterative method, the semi-ordered fast iterative method (SOFI) offers increased stability for variations in the front velocity. So far, the method has only been investigated in a serial, two-dimensional context; in this paper we investigate a parallel implementation of SOFI (using OpenMP) and evaluate the method for three-dimensional real-world type problems. We discuss the parallel algorithm and compare its performance and its computed solutions with an OpenMP-powered fast iterative method. Different speed functions together with varying problem sizes are used to investigate the impact of the computational load. Although the semi-ordered fast iterative method is inferior to the fast iterative method with respect to parallel efficiency, we show that its execution performance is significantly faster. |
Year | Venue | Field |
|---|---|---|
2015 | SpringSim (HPS) | Shared memory parallelization,Front propagation,Front velocity,Parallel algorithm,Computer science,Iterative method,Eikonal equation,Computational science,Local convergence,Monotone polygon |
DocType | Citations | PageRank |
Conference | 1 | 0.37 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josef Weinbub | 1 | 17 | 9.55 |
| Florian Dang | 2 | 1 | 0.37 |
| Tor Gillberg | 3 | 1 | 0.37 |
| Siegfried Selberherr | 4 | 105 | 39.95 |