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.

中文翻译：

---

在并行Ekonnal解算器中利用异步优先级调度

使用快速行进方法，快速扫掠方法和快速迭代方法的变体来计算Eikonal方程的数值解。在本文中，我们提供了这些算法的统一视图，突出了它们的相似性，并提出了更多种类的Eikonal求解器。然后，我们使用此框架来证明将并发优先级调度技术应用于Eikonal求解程序是合理的。我们证明，这样做可以为地震学问题带来良好的并行性能。我们将解释为何现有的Eikonal求解器尽管使用相同的差分方案仍可能产生不同的结果，并说明了解决这些差异的技术。这些技术使我们能够从异步细粒度并行Eikonal求解器获得确定性输出。