2021/03/09 by Ian Henriksen, Henriksen, Ian, Bozhi You +3
Computer Science · #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #FOS: Mathematics #Interconnection Networks and Systems #Mathematical Software (cs.MS) #Numerical Analysis (math.NA) #Parallel #Parallel Computing and Optimization Techniques #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2103.05694
openalex publication_date 2021/03/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Numerical solutions to the Eikonal equation are computed using variants of the fast marching method, the fast sweeping method, and the fast iterative method. In this paper, we provide a unified view of these algorithms that highlights their similarities and suggests a wider class of Eikonal solvers. We then use this framework to justify applying concurrent priority scheduling techniques to Eikonal solvers. We demonstrate that doing so results in good parallel performance for a problem from seismology. We explain why existing Eikonal solvers may produce different results despite using the same differencing scheme and demonstrate techniques to address these discrepancies. These techniques allow us to obtain deterministic output from our asynchronous fine-grained parallel Eikonal solver.