Efficient parallel generation of partitioned, unstructured meshes

Abstract In this paper we introduce a method for generating unstructured meshes in parallel which are partitioned in a ‘good’ way. When solving a partial differential equation on a parallel distributed memory machine, the mesh should be decomposed so that the communication requirement of the numerical solver is minimised and also the amount of work to be performed on each processor is approximately equal. Most previous work in this area has concentrated on partitioning a mesh that has already been generated. We introduce a method which actually generates the partitioned mesh in parallel whilst producing a good quality decomposition and compare this method with other approaches.

[1]  B. Parlett,et al.  On estimating the largest eigenvalue with the Lanczos algorithm , 1982 .

[2]  N. Weatherill.  A method for generating irregular computational grids in multiply connected planar domains , 1988 .

[3]  Barry W. Peyton,et al.  Toward a Parallel Recursive Spectral Bisection Mapping Tool , 1993, PPSC.

[4]  Martin Berzins,et al.  Dynamic load-balancing for PDE solvers on adaptive unstructured meshes , 1995, Concurr. Pract. Exp..

[5]  Rainald Loehner,et al.  Parallel unstructured grid generation , 1991 .

[6]  O. C. Zienkiewicz,et al.  Adaptive remeshing for compressible flow computations , 1987 .

[7]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[8]  Dirk Roose,et al.  An Improved Spectral Bisection Algorithm and its Application to Dynamic Load Balancing , 1995, EUROSIM International Conference.

[9]  William Gropp,et al.  A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation , 1985, PP.

[10]  Joseph E. Flaherty,et al.  Parallel adaptive mesh refinement and redistribution on distributed memory computers , 1994 .

[11]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[12]  V. Venkatakrishnanz.  A Parallel Dynamic Load Balancing Algorithm for 3-d Adaptive Unstructured Grids , 1993 .

[13]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[14]  D C Hodgson,et al.  Ecient Mesh Partitioning for Parallel P.d.e. Solvers on Distributed Memory Machines Extended Version of the Paper Which Appears in the Proceedings of the Sixth Siam Conference on Parallel Processing for Scientic Computing , 1993 .

[15]  Ricardo Baeza-Yates,et al.  Computer Science 2 , 1994 .

[16]  Peter K. Jimack,et al.  Efficient Mesh Partitioning for Parallel P.D.E. Solvers on Distributed Memory Machines , 1993, PPSC.

[17]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[18]  Asad Iqbal Khan,et al.  Computational schemes for parallel finite element analysis , 1994 .

[19]  B. H. V. Topping,et al.  An Optimization-Based Approach to the Domain Decomposition Problem in Parallel Finite Element Analysis , 1993 .

[20]  Barry Hilary Valentine Topping,et al.  Parallel adaptive mesh generation , 1991 .