Basic HTML version of Foils prepared October 1995

Foil 4 Grid Decomposition

From Intro HPF September 27, 1995 CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95. by Tom Haupt and Nancy McCracken


1 The compiler decomposes the grid array onto processors by equal pieces
2 For each interior point, the algorithm must access the immediate neighbors according to a 5 point stencil, which may sometimes involve communication with other processors:
3 Then the algorithm can be implemented by code which first communicates the internal boundaries and then loops over the interior points on each processor.

in Table To:


© on Tue Oct 7 1997