A highly scalable massively parallel fast marching method for the Eikonal equation

Abstract The fast marching method is a widely used numerical method for solving the Eikonal equation arising from a variety of scientific and engineering fields. It is long deemed inherently sequential and an efficient parallel algorithm applicable to large-scale practical applications is not available in the literature. In this study, we present a highly scalable massively parallel implementation of the fast marching method using a domain decomposition approach. Central to this algorithm is a novel restarted narrow band approach that coordinates the frequency of communications and the amount of computations extra to a sequential run for achieving an unprecedented parallel performance. Within each restart, the narrow band fast marching method is executed; simple synchronous local exchanges and global reductions are adopted for communicating updated data in the overlapping regions between neighboring subdomains and getting the latest front status, respectively. The independence of front characteristics is exploited through special data structures and augmented status tags to extract the masked parallelism within the fast marching method. The efficiency, flexibility, and applicability of the parallel algorithm are demonstrated through several examples. These problems are extensively tested on six grids with up to 1 billion points using different numbers of processes ranging from 1 to 65536. Remarkable parallel speedups are achieved using tens of thousands of processes. Detailed pseudo-codes for both the sequential and parallel algorithms are provided to illustrate the simplicity of the parallel implementation and its similarity to the sequential narrow band fast marching algorithm.

[1]  M. Herrmann.  A Domain Decomposition Parallelization of the Fast Marching Method , 2003 .

[2]  Are Magnus Bruaset,et al.  Parallel solutions of static Hamilton-Jacobi equations for simulations of geological folds , 2014 .

[3]  Phillip Colella,et al.  Two new methods for simulating photolithography development in 3D , 1996, Advanced Lithography.

[4]  Ross T. Whitaker,et al.  A Fast Iterative Method for Eikonal Equations , 2008, SIAM J. Sci. Comput..

[5]  Zhao,et al.  PARALLEL IMPLEMENTATIONS OF THE FAST SWEEPING METHOD , 2007 .

[6]  Maria Cristina Tugurlan,et al.  Fast Marching Methods - parallel implementation and analysis , 2008 .

[7]  F. Stern,et al.  Motion Prediction Using Wall-Resolved and Wall-Modeled Approaches on a Cartesian Grid , 2010 .

[8]  E. Rouy,et al.  A viscosity solutions approach to shape-from-shading , 1992 .

[9]  Alexander Vladimirsky,et al.  Fast Two-scale Methods for Eikonal Equations , 2011, SIAM J. Sci. Comput..

[10]  P. Gács,et al.  Algorithms , 1992 .

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[13]  Alexander M. Bronstein,et al.  Parallel algorithms for approximation of distance maps on parametric surfaces , 2008, TOGS.

[14]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[15]  Michael Breuß,et al.  An adaptive domain-decomposition technique for parallelization of the fast marching method , 2011, Appl. Math. Comput..

[16]  Hongkai Zhao,et al.  A fast sweeping method for Eikonal equations , 2004, Math. Comput..

[17]  Frédéric Gibou,et al.  A parallel fast sweeping method for the Eikonal equation , 2013, J. Comput. Phys..

[18]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Bobby Bodenheimer,et al.  Synthesis and evaluation of linear motion transitions , 2008, TOGS.

[20]  Alexander Vladimirsky,et al.  A Parallel Two-Scale Method for Eikonal Equations , 2015, SIAM J. Sci. Comput..

[21]  Frederick Stern,et al.  Scalability studies and large grid computations for surface combatant using CFDShip-Iowa , 2011, Int. J. High Perform. Comput. Appl..