Partitioning & Mapping of Unstructured Meshes to Parallel Machine Topologies
نویسندگان
چکیده
We give an overview of some strategies for mapping unstructured meshes onto processor grids. Sample results show that the mapping can make a considerable difference to the communication overhead in the parallel solution time, particularly as the number of processors increase.
منابع مشابه
Mapping unstructured mesh codes onto local memory parallel architectures
Initial work on mapping CFD codes onto parallel systems focused upon software which employed structured meshes. Increasingly, many large scale CFD codes are being based upon unstructured meshes. One of the key problem when implementing such large scale unstructured problems on a distributed memory machine is the question of how to partition the underlying computational domain efficiently. It is...
متن کاملExdasy - A User-Friendly and Extendable Data Distribution System
This paper introduces Exdasy, a user-friendly and extendable software tool for partitioning unstructured meshes and mapping mesh partitions to parallel computers. Exdasy was designed to meet the increasing demands to today’s data distribution systems, which are posed by the variety of mesh computations, the ongoing development of distribution algorithms and rapid changes in parallel hardware te...
متن کاملEfficient Parallel Generation of Partitioned , Unstructured Meshes
In this paper we introduce a method for generating unstructured meshes in parallel which are partitioned in a \good" way. When solving a partial dierential 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....
متن کاملParallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equival...
متن کاملParallel dynamic graph-partitioning for unstructured meshes
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimisation technique known as relative gain optimisation which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equival...
متن کامل