Jacobi Iteration: MPI Program Design
Partitioning is simple
- Every point is a micro-task
Communication is simple
- 4 nearest neighbors in Cartesian mesh
- Reduction for convergence test
Agglomeration works along dimensions
- 1-D packing for high-latency machines
- 2-D packing for others (most general)
- One process per processor practically required