Basic HTML version of Foils prepared 15 March 1996

Foil 54 Data Allocation Approaches

From Physical Optimization and Physical Computation CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox
1 Allocation problem as a graph isomorphism problem
  • - a maximum number of pairs of communicating modules fall into pairs of directly connected processors
2 Allocation problem as a quadratic assignment problem
3 -
4 Allocation problem as a minmax problem
5 -
6 Geometry based allocation approach
  • - represent the partioning of the domain by a graph
  • - represent the parallel machine by a graph
  • - project the problem and system graphs into the 2D-euclidean space
  • - solve a planar assignment problem
  • - Iteratively improve the initial assignment
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