Basic HTML version of Foils prepared April 7,1995

Foil 13 Methodology of Parallel Computing

From Programming Paradigms A CRPC/MCNC Workshop -- April 10-13 1995. by Geoffrey C. Fox
1 Simple, but general and extensible to many more nodes is domain decomposition
2 All successful concurrent machines with
  • Many nodes
  • High performance (this excludes Dataflow)
3 Have obtained parallelism from "Data Parallelism" or "Domain Decomposition"
4 Problem is an algorithm applied to data set
  • Obtain concurrency by acting on data concurrently.
5 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
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