Multilevel algorithms for generating coarse grids for multigrid methods
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Performance of a new CFD flow solver using a hybrid programming paradigm
Journal of Parallel and Distributed Computing
Parallel mesh adaptive techniques illustrated with complex compressible flow simulations
Modelling and Simulation in Engineering
Hi-index | 0.00 |
A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strategy is described which avoids breaking the implicit lines across processor boundaries, while incurring minimal additional communication overhead. Good scalability is demonstrated on a 128 processor SGI Origin 2000 machine and on a 512 processor CRAY T3E machine for reasonably fine grids. The feasibility of performing large-scale unstructured grid calculations with the parallel multigrid algorithm is demonstrated by computing the flow over a partial-span flap wing high-lift geometry on a highly resolved grid of 13.5 million points in approximately 4 hours of wall clock time on the CRAY T3E.