View in EDS

Parallel Decomposition of Unstructured FEM-Meshes

Saved in:
Bibliographic Details
Title: Parallel Decomposition of Unstructured FEM-Meshes
Authors: Ralf Diekmann, Derk Meyer, Burkhard Monien
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: ftp://ftp.uni-paderborn.de/doc/techreports/Informatik/tr-rsfb-96-004.ps.Z
Publisher Information: Springer
Publication Year: 1995
Collection: CiteSeerX
Subject Terms: Parallel Adaptive Finite Element Simulations, Parallel Mesh Decomposition, Parallel Graph Partitioning, Remapping/Repartitioning, Dynamic Mapping
Description: We present a massively parallel algorithm for static and dynamic partitioning of unstructured FEM-meshes. The method consists of two parts. First a fast but inaccurate sequential clustering is determined which is used, together with a simple mapping heuristic, to map the mesh initially onto the processors of a massively parallel system. The second part of the method uses a massively parallel algorithm to remap and optimize the mesh decomposition taking several cost functions into account which reflect the characteristics of the underlying hardware and the requirements of the numerical solution method supposed to run after the decomposition. The parallel algorithm first calculates the amount of nodes that have to be migrated between pairs of clusters in order to obtain an optimal load balancing. In a second step, nodes to be migrated are chosen according to cost functions optimizing the amount of necessary communication and the shapes of subdomains. The latter criterion is extremely imp.
Document Type: text
File Description: application/postscript
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.5438
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.5438
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.F2073D5E
Database: BASE
Description
Abstract:We present a massively parallel algorithm for static and dynamic partitioning of unstructured FEM-meshes. The method consists of two parts. First a fast but inaccurate sequential clustering is determined which is used, together with a simple mapping heuristic, to map the mesh initially onto the processors of a massively parallel system. The second part of the method uses a massively parallel algorithm to remap and optimize the mesh decomposition taking several cost functions into account which reflect the characteristics of the underlying hardware and the requirements of the numerical solution method supposed to run after the decomposition. The parallel algorithm first calculates the amount of nodes that have to be migrated between pairs of clusters in order to obtain an optimal load balancing. In a second step, nodes to be migrated are chosen according to cost functions optimizing the amount of necessary communication and the shapes of subdomains. The latter criterion is extremely imp.