Skip to content

Commit 05bee2f

Browse files
committed
Update decomposition page
1 parent 164ae54 commit 05bee2f

File tree

1 file changed

+2
-0
lines changed

1 file changed

+2
-0
lines changed

docs/source/pages/domaindecomposition.rst

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@ In early days, many applications based on structured meshes and using implicit n
99

1010
.. image:: 1d_decomp.png
1111
:width: 1000
12+
1213
Figure 1: 1D domain decomposition example using 4 MPI-processes (1 per slab): (a) decomposed in Y direction; (b) decomposed in X direction.
1314

1415
2D Pencil Decomposition
@@ -18,6 +19,7 @@ A 2D pencil decomposition (also known as a 'drawer' or 'block' decomposition) is
1819

1920
.. image:: 2d_decomp.png
2021
:width: 1200
22+
2123
Figure 2: 2D domain decomposition example using a 4*3 mesh decomposition : (a) X-pencil; (b) Y-pencil; (c) Z-pencil.
2224

2325
Again `MPI_ALLTOALL(V)` can be used to realise the transpositions. However it is significantly more complex than the 1D case. There are two separate communicator groups. For a Prow*Pcol processor grid: Prow groups of Pcol processors need to exchange data among themselves for (a) <=> (b) ; Pcol groups of Prow processors need to exchange data among themselves for (b) <=> (c). For example, the red, green and blue processes in state (b) and (c) occupy exactly the same physical domain.

0 commit comments

Comments
 (0)