A Parallel Rendezvous Algorithm for Interpolation Between Multiple Grids

A number of computational procedures employ multiple grids on which solutions are computed. For example, in multi-physics simulations a primary grid may be used to compute mechanical deformation of an object while a secondary grid is used for thermal conduction calculations. When modeling coupled thermo-mechanical effects, solution data must be interpolated back and forth between the grids each timestep. On a parallel machine, this grid transfer operation can be challenging if the two grids are decomposed to processors differently for reasons of computational efficiency. If the grids move or adapt separately, the complexity of the operation is compounded. In this paper we describe a grid transfer algorithm suitable for massively parallel codes which use multiple grids. It uses a rendezvous technique wherein a third decomposition is used to search for elements in one grid that contain nodal points of the other. This has the advantage of enabling the grid transfer to be load-balanced separately from the remainder of the computations. The algorithm has been implemented as an object-oriented tool for the multi-physics code SIERRA, currently under development at Sandia. Performance and scalability results for the grid transfer operation running on the Intel/Sandia TFLOPS supercomputer are presented.

[1]  Bruce Hendrickson,et al.  Parallel strategies for crash and impact simulations , 1998 .

[2]  Ray S. Tuminaro,et al.  Parallel Smoothed Aggregation Multigrid : Aggregation Strategies on Massively Parallel Machines , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[3]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[4]  Courtenay T. Vaughan,et al.  Parallel Transient Dynamics Simulations: Algorithms for Contact Detection and Smoothed Particle Hydrodynamics , 1998, J. Parallel Distributed Comput..

[5]  Bruce Hendrickson,et al.  Dynamic load balancing in computational mechanics , 2000 .

[6]  David S. Greenberg,et al.  Massively parallel computing using commodity components , 2000, Parallel Comput..

[7]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[8]  John Zahorjan,et al.  Dynamic-domain-decomposition parallel molecular dynamics , 1997 .

[9]  Gabriel Wittum,et al.  A Parallel Software-Platform for Solving Problems of Partial Differential Equations using Unstructured Grids and Adaptive Multigrid Methods , 1999 .

[10]  Arlindo da Silva,et al.  Parallel Grid Manipulations in Earth Science Calculations , 1998, VECPAR.

[11]  Bruce Hendrickson,et al.  The Chaco user`s guide. Version 1.0 , 1993 .

[12]  Vipin Kumar,et al.  A New Algorithm for Multi-objective Graph Partitioning , 1999, Euro-Par.

[13]  Robert L. Meakin,et al.  Dynamic overset grid communication on distributed memory parallel processors , 1993 .

[14]  Mark T. Jones,et al.  Computational Results for Parallel Unstructured Mesh Computations , 1994 .

[15]  E. Barszcz,et al.  Moving body overset grid applications on distributed memory MIMD computers , 1995 .

[16]  Jonathan Eckstein.  Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5 , 1997, Comput. Optim. Appl..

[17]  Steven J. Plimpton,et al.  A Parallel Rendezvous Algorithm for Interpolation Between Multiple Grids , 1998 .

[18]  D. W. Barnette.  A user`s guide for BREAKUP: A computer code for parallelizing the overset grid approach , 1998 .