Basic HTML version of Foils prepared 14 October 1997

Foil 58 Essential Structure of Message Parallel O(N2) Algorithm - II

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 Note that MPGrav(i) result depends on the array Xuse and fixed parameters such as mass
  • It happens to be independent of time and velocity although sucvh velocity and time dependent forces could be accomodated
2 The calculation involves an iteration over desired number of time steps increasing t by h each time.
3 Each time step involves 9 phases -- at each phase, one loops over all N particles (or rather over all N/Nproc particles stored in a given processor)
4 Some phases (4 of them) involve communication and computation; the others "just" SPMD computation.
5 The number of phases depends on ODE strategy used -- with the simple Euler method, there are 1 or 2 phases, depending on how one counts.

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