Basic HTML version of Foils prepared 19 September 98

Foil 73 Jacobi Iteration: MPI Program Design

From MPI Message Passing Interface Computational Science for Simulations -- Fall Semester 1998. by Geoffrey C. Fox, Nancy McCracken
1 Partitioning is simple
  • Every point is a micro-task
2 Communication is simple
  • 4 nearest neighbors in Cartesian mesh
  • Reduction for convergence test
3 Agglomeration works along dimensions
  • 1-D packing for high-latency machines (as minimizes number of messages)
  • 2-D packing for others (most general as minimizes information sent)
  • One process per processor practically required
in Table To:

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Apr 11 1999