Scripted HTML version of Foils prepared 29 August 1995

Foil 131 Methodology of Parallel Computing

From Initial CPS615 Course and Parallel Computing Overview CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95. by Geoffrey C. Fox *

Simple, but general and extensible to many more nodes is domain decomposition
All successful concurrent machines with
  • Many nodes
  • High performance (this excludes Dataflow)
Have obtained parallelism from "Data Parallelism" or "Domain Decomposition"
Problem is an algorithm applied to data set
  • Obtain concurrency by acting on data concurrently.
The three architectures considered here differ as follows:
  • MIMD Distributed Memory -- Processing and Data Distributed
  • MIMD Shared Memory -- Processing Distributed but memory shared
  • SIMD Distributed Memory -- 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 Thu Aug 14 1997