Basic HTML version of Foils prepared 15 March 1996

Foil 52 Typical Example of Data Mapping Problem

From Physical Optimization and Physical Computation CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox
Given: Data set and Algorithm / Solver
Assumptions: Data Parallelism Loosely Synchronous Computation model Distributed-memory MIMD multiprocessor
Definitions: Computation graph GC = (VC, EC) Multiprocessor graph GM = (VM, EM)

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