A parallel rendezvous algorithm for interpolation between multiple grids

Authors:
Steve Plimpton;Bruce Hendrickson;James Stewart
Affiliations:
Sandia National Labs, Albuquerque, NM;Sandia National Labs, Albuquerque, NM;Sandia National Labs, Albuquerque, NM
Venue:
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Year:
1998

Citing 3
Cited 4

A Partitioning Strategy for Nonuniform Problems on Multiprocessors

IEEE Transactions on Computers
Distributed versus Centralized Storage and Control forParallel Branch and Bound: Mixed Integer Programming on the CM-5

Computational Optimization and Applications
Parallel transient dynamics simulations

Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications

Fast algorithms for computing self-avoiding walks and mesh intersections over unstructured meshes

Advances in Engineering Software
A parallel rendezvous algorithm for interpolation between multiple grids

Journal of Parallel and Distributed Computing
Concatenation algorithms for parallel numerical simulation of radiation hydrodynamics coupled with neutron transport

International Journal of Parallel Programming
Algorithm 932: PANG: Software for nonmatching grid projections in 2D and 3D with linear complexity

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.