Domain Decomposition Parallelization of Mesh Based Applications
11.01.2002
Start Lecture by clicking here
Content
Author:
Panagiotis Adamidis and Thomas Bönisch
Domain Decomposition Parallelization of Mesh Based Applications
Outline
Parallelization - Target
A Problem (I)
Parallelization strategies
Parallelization Problems
Concepts - Message Passing (II)
How to split the Domain in the Dimensions (I)
How to split the Domain in the Dimensions (II)
Replication versus Communication (I)
Replication versus Communication (II)
2- Dimensional DD with two Halo Cells
Example: Parallelization of a 3D Finite Volume Flow Solver
Starting Point: Sequentiell Program
Dynamic Data Structures
Main Loop
Heptadiagonalmatrix
Parallelization - Solver (I)
Parallelization - Solver (II)
Parallelization - Solver (III)
A Real Heptadiagonalmatrix
Difference between strong / weak coupling
Comparison of Solvers - Convergence
Comparison of Solvers - Performance
Results - Solving Method
Domain Decomposition
Speedup on Cray T3E
Scaleup on Cray T3E
Domain Decomposition of Unstructured Grids
Unstructured FEM Grid with Global Numbering
Shape of Corresponding System Matrix
Domain Decomposition
1. Nonoverlapping Domain Decomposition
2. Grid Points Separated into Inner and Boundary Points
3. Renumbering of the Inner and Boundary Points
Arrow Shaped System Matrix after Renumbering
Data Distribution
Linear System
Direct Substructuring
Transformations of the Original System
Schurcomplement System
1.Direct Factorization
2.Assembiing of the Schur complement system (I)
2.Assembiing of the Schur complement system (II)
3.Solving of the Schur complement system
4.Solving of the interior unknows
Parallel Computations on the Subdomains
Overlapping Domain Decomposition
Literature
Back to the Parallel Programming Workshop Overview