A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Computational Optimization and Applications
Parallel transient dynamics simulations
Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
Massively parallel computing using commodity components
Parallel Computing - Parallel computing on clusters of workstations
Parallel smoothed aggregation multigrid: aggregation strategies on massively parallel machines
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
A parallel rendezvous algorithm for interpolation between multiple grids
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
A New Algorithm for Multi-objective Graph Partitioning
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Parallel Grid Manipulations in Earth Science Calculations
VECPAR '98 Selected Papers and Invited Talks from the Third International Conference on Vector and Parallel Processing
A framework approach for developing parallel adaptive multiphysics applications
Finite Elements in Analysis and Design - Special issue: The fifteenth annual Robert J. Melosh competition
Journal of Computational Physics
Optimal parameterized rectangular coverings
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Algorithms for rectangular covering problems
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Hi-index | 0.01 |
A number of computational procedures employ multiple grids on which solutions are computed. For example, in multiphysics 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 across 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 two grid transfer algorithms suitable for massively parallel simulations which use multiple grids. They use 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 operation to be load-balanced separately from the remainder of the computations. The algorithms are designed for use within the multi-physics code SIERRA, an object-oriented framework developed at Sandia. Performance and scalability results are given for the grid transfer operation running on up to 1024 processors of two large parallel machines, the Intel Tflops (ASCI Red) and DEC-Alpha CPlant cluster.