Basic HTML version of Foils prepared 14 October 1997

Foil 61 Features of Message Parallel Computation

From Fox Presentation Fall 1995 CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95/96/97. by Nancy McCracken and Geoffrey C. Fox


1 This problem is classic SPMD with different phases of computing and communication which the four 4 MPGrav phases further subdividable into subphases which are compute only -- communicate only phases
2 We divide particles equally between processors
  • N Particles
  • Nproc Processors
  • N/Nproc particles per processor
3 As no "locality" in force, all particles are "equal" and it does not matter which particle is placed in which processor
4 Remember each of nine phases is a full loop over all particles in a given processor with local index running from 1 ... N/Nproc
5 We get "automatic" balanced parallel computation in steps 1) 3) 5) 9) with "embarassingly parallel" (i.e. no communication) operation

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 Fri Oct 2 1998