|
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
-
and obtains 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 data shared
|
SIMD Distributed Memory
-
Synchronous Processing on Distributed Data
|
