Parallel Mesh Generation, Migration and Partitioning for the Elmer Application
نویسندگان
چکیده
The main goal of this project is to develop a parallel tetrahedral mesh generator based on existing sequential mesh generation software. As sequential mesh generation software, the Netgen mesh generator was used due to its availability as LGPL open source software and its wide user base. Parallel mesh generation routines were developed using the MPI libraries and the C++ language. The parallel mesh generation algorithms developed proceed by decomposing the whole geometry into a number of sub-geometries sequentially on a master node at the beginning and then mesh each sub-geometry in parallel on multiple processors. Three methods were implemented. The first decomposes the CAD geometry and produces conforming surface sub-meshes that are sent to other processors for volume mesh generation. The second and third methods are refinement based methods that also make use of the CAD geometry information. Advantages and disadvantages of each method are discussed. Parallel repartitioning also need to be done in the first method. To facilitate distributed element movements in parallel, a migration algorithm that utilizes "owner updates" rule is developed. Timing results obtained on the Curie supercomputer are presented. In particular, results show that by using a refinement based method, one can generate over a billion element meshes in under a minute.
منابع مشابه
Parallel Mesh Generation in GeoFEM
We propose large-scale parallel mesh generation method for GeoFEM. Figure 1 shows the flow diagram, which is composed of four processes. First process is a mesh generation. In the process two applications is used. Second process is attachment of boundary conditions using GUI application: GPPView[1]. Third process is partitioning to generate GeoFEM parallel FE meshes. Final process is relocation...
متن کاملSimultaneous Mesh Generation and Partitioning for Delaunay Meshes
In this paper, we present a new approach for the parallel generation and partitioning of unstructured 3D meshes. The new approach couples the mesh generation and partitioning problems into a single optimization problem. Traditionally, these two problems are solved separately, rst generating the mesh (usually sequentially) and then partitioning the mesh either sequentially or in parallel. In the...
متن کاملPii: 0045-7825(96)01024-9
Mesh partitioning is often the preferred approach for solving unstructured computational mechanics problems on massively parallel processors. Research in this area has focused so far on the automatic generation of subdomains with minimum interface points. In this paper, we address this issue and emphasize other aspects of the partitioning problem including the fast generation of large-scale mes...
متن کاملDRAMA: A Library for Parallel Dynamic Load Balancing of Finite Element Applications
We describe a software library for dynamic load balancing of finite element codes. The application code has to provide the current distributed mesh and information on the calculation and communication requirements, and receives from the library all necessary information to re-allocate the application data. The library computes a new partitioning, either via direct mesh migration or via parallel...
متن کاملTowards an Efficient Distributed Geometry for Parallel Mesh Generation
This paper discusses the implementation of a distributed geometry for parallel mesh generation, involving dynamic load-balancing and hence dynamic re-partitioning of the geometry. A novel approach is described for improving the efficiency of the distributed geometry interface when dealing with irregular shaped mesh partitions.
متن کامل