X - UWSpace - University of Waterloo
X - UWSpace - University of Waterloo
X - UWSpace - University of Waterloo
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
SIMD vs MIMD<br />
Panllel computers cm be classified into two groups by Fiynn [1966]: SiMD (Single<br />
Instruction, Multiple Data) and MiMD (Multiple instruction, Multiple Data).<br />
A SLMD machine consists <strong>of</strong> a number <strong>of</strong> identical processors doing the same things to<br />
different data at any given point <strong>of</strong> time. Typical SIMD machines have large numbers <strong>of</strong> relatively<br />
simple and affordable processors ~sulting in fine-gnined parallelism. which distributes the data<br />
as widely as possible with each processor performing the simplest operations.<br />
in MIMD machines, the most widely employed parallel machine architecture. each<br />
processor enecutes a possibly different program on different data under the conuol <strong>of</strong> different<br />
instruction asynchronously. The MIMD machines generally have fewer but mon powerful<br />
processon than SIMD machines.<br />
Shared Memory vs Message Passing<br />
Another architecturai classification is whether the parallel computer is a shared memory<br />
machine or a message passing machine according to how the processors cornrnunicate with each<br />
other.<br />
Shared memory computen have global memory that can be directly accessed by dl<br />
processon. Shared memocy computen are not very scalrble. panicularly when the entire global<br />
memory is equally accessible to dl <strong>of</strong> luge number <strong>of</strong> processors. They also impose an inherent<br />
concem <strong>of</strong> s ynchronization. i .e. how different processors can read and write the data in the same<br />
location <strong>of</strong> memory simultaneously without conflict. Currently, most shared memory computers<br />
13