Basic HTML version of Foils prepared February 13 00

Foil 22 General Speed Up and Efficiency Analysis II

From Master Set for Parallel Programming for Laplace's Equation CPS615 Spring Semester 00 -- February 00. by Geoffrey C. Fox


1 In many problems there is an elegant formula fcomm = constant . tcomm/(n1/d tfloat)
2 d is system information dimension which is equal to geometric dimension in problems like Jacobi where communication is a surface and calculation a volume effect
  • We will see soon case where d is NOT geometric dimension
3 d=1 for Hadrian's wall and d=2 for Hadrian's Palace floor while for Jacobi in 1 2 or 3 dimensions, d =1 2 or 3
4 Note formula only depend on local node and communication parameters and this implies that parallel computing does scale to large P if you build fast enough networks (tcomm/tfloat) and have a large enough problem (big n)

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 Mon Feb 21 2000