Basic HTML version of Foils prepared May 7 1996

Foil 58 Software Issues - Methodology of Parallel Computing

From MetaComputing -- MRA Meeting Part I:Concepts and Issues Tutorial for CRPC MRA Meeting at Cornell -- May 7 1996. by Mark Baker, Geoffrey Fox
Simple, but general and extensible to many more nodes is domain decomposition
Most successful concurrent machines with many nodes have obtained good performance from "Data Parallelism" or "Domain Decomposition"
Problem is an algorithm applied to data set
  • - Obtain parallelism by acting on data concurrently.
The three architectures considered here differ as follows:
  • - MIMD-DM - Processing and Data Distributed - MIMD-SM - Processing Distributed but memory shared - SIMD-DM - Synchronous Processing on Distributed 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