Basic HTML version of Foils prepared
August 29 98
Foil 32 Time for Finite Difference
From
Designing and Building Parallel Programs I: Introduction DoD Modernization Tutorial --
1995-1998
.
by
Ian Foster, Gina Goff, Ehtesham Hayder, Chuck Koelbel
1
Identical computations at each grid point
Tcomp = tcN2Z (tc is compute time/point)
2
1-D decomposition, so each node sends 2NZ data to 2 neighbors [if ? 2 rows/node]
Tcomm = P(ts2 + tw4NZ)
3
No significant idle time if load balanced
Tidle = 0
4
Therefore, T = tcN2Z/P + ts2 + tw4NZ
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