Basic HTML version of Foils prepared 15 March 1996

Foil 50 Physics Analogy for Load Balancing

From Complex Systems and Parallel Computing CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox
1 Label data points (members of problem spatial domain by i
2 Each i ---> Particle moving in space with discrete points (number of points in space = number of nodes in machine) and with topology defined by interconnection of nodes
3 Let problem be defined by parameters:
  • Execution time Ci for each i
  • Communication time Vi,j between data points i and j
  • (Vi,j often zero; nonzero only if i and j linked in computational graph)
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 Feb 22 1998