Unstructured 3-D Grid Partitioning Methods Based On Genetic Algorithms
نویسنده
چکیده
In this paper, two methods that are capable to efficiently partition 3-D unstructured grids for parallel processing, will be presented. Implicit to either of these methods are a recursive bisection pattern, a multilevel acceleration scheme and local refinement heuristics. Although both are based on Genetic Algorithms (GAs), their concept and formulation are completely different. The first method uses binary coding, where 0’s and 1’s denote owning processor for each grid entity. The second method encodes a few control parameters that define a unique bisection of the grid, on the equivalent graph, where a physical problem is solved. Advantages and disadvantages of both methods will be cited and a hybrid scheme will be suggested as a fast alternative partitioner.
منابع مشابه
Parallel Sn Sweeps on Unstructured Grids: Algorithms for Prioritization, Grid Partitioning, and Cycle Detection
The method of discrete ordinates is commonly used to solve the Boltzmann transport equation. The solution in each ordinate direction is most efficiently computed by sweeping the radiation flux across the computational grid. For unstructured grids this poses many challenges, particularly when implemented on distributed-memory parallel machines where the grid geometry is spread across processors....
متن کاملPartitioning of Unstructured Problems for Parallel Processing Horst
Many large scale computational problems are based on unstruc-tured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. Here we will address the question of how to distribute such unstructured computational domains over a large number of p...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملGuide to Partitioning Unstructured Meshes for Parallel Computing
Unstrucutured grids are used frequently in finite element or finite volume analysis. Unlike structured grids which are mostly applicable to finite difference schemes, unstructured grids require a list of the connectivity which specifies the way that a given set of vertices form the individual elements. To implement models that use an unstructured numerical decomposition on a distributed memory ...
متن کاملParallel Performance Optimizations on Unstructured Mesh-based Simulations
This paper addresses two key parallelization challenges the unstructured mesh-based ocean modeling code, MPAS-Ocean, which uses a mesh based on Voronoi tessellations: (1) load imbalance across processes, and (2) unstructured data access patterns, that inhibit intraand inter-node performance. Our work analyzes the load imbalance due to naive partitioning of the mesh, and develops methods to gene...
متن کامل