Basic HTML version of Foils prepared August 29 98

Foil 27 Modeling Performance

From Designing and Building Parallel Programs I: Introduction DoD Modernization Tutorial -- 1995-1998. by Ian Foster, Gina Goff, Ehtesham Hayder, Chuck Koelbel
Execution time (sums are over P nodes) is
  • T = (sum[Tcomp]+ sum[Tcomm] + sum[Tidle])/P
Computation time comprises both
  • Operations required by sequential algorithm
  • Additional work, replicated work
Idle time due to
  • Load imbalance, and/or
  • Latency (waiting for remote data)

© 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