Flynn's taxonomy

Flynn's taxonomy is a classification of computer architectures, proposed by Michael J. Flynn in 1966. [Flynn, M., Some Computer Organizations and Their Effectiveness, IEEE Trans. Comput., Vol. C-21, pp. 948, 1972.] [Duncan, Ralph, "A Survey of Parallel Computer Architectures", IEEE Computer. February 1990, pp. 5-16.]

Classifications

The four classifications defined by Flynn are based upon the number of concurrent instruction (or control) and data streams available in the architecture:

; Single Instruction, Single Data stream (SISD): A sequential computer which exploits no parallelism in either the instruction or data streams. Examples of SISD architecture are the traditional uniprocessor machines like a PC or old mainframes.

; Single Instruction, Multiple Data streams (SIMD): A computer which exploits multiple data streams against a single instruction stream to perform operations which may be naturally parallelized. For example, an array processor or GPU.

; Multiple Instruction, Single Data stream (MISD): Multiple instructions operate on a single data stream. Uncommon architecture which is generally used for fault tolerance. Heterogeneous systems operate on the same data stream and must agree on the result. Examples include the Space Shuttle flight control computer.

; Multiple Instruction, Multiple Data streams (MIMD): Multiple autonomous processors simultaneously executing different instructions on different data. Distributed systems are generally recognized to be MIMD architectures; either exploiting a single shared memory space or a distributed memory space.

Diagram comparing Classifications

Visually, these four architectures are shown below where each "PU" is a processing unit::

Further Divisions

As of 2006, all the top 10 and most of the TOP500 supercomputers are based on a MIMD architecture.

Some further divide the MIMD category into the following categories: [http://www.llnl.gov/casc/Overture/henshaw/documentation/App/manual/node36.html ] [http://www.cisl.ucar.edu/docs/lightning/program.jsp ] [http://web0.tc.cornell.edu/Services/Education/Topics/Parallel/Design/SPMD.aspx ] [http://math.nist.gov/~KRemington/Primer/distrib.html ] [http://www.cisl.ucar.edu/docs/ibm/ref/parallel.html ]

; Single Program, Multiple Data (SPMD): Multiple autonomous processors simultaneously executing the same program (but at independent points, rather than in the lockstep that SIMD imposes) on different data. Also referred to as 'Single Process, multiple data' [http://www.cisl.ucar.edu/docs/ibm/ref/parallel.html] . SPMD is the most common style of parallel programming [http://www.nist.gov/dads/HTML/singleprogrm.html] . The term was originally coined by Gregory F. Pfister [Frederica Darema, David A. George, V. Alan Norton, and Gregory F. Pfister. "A single-program-multiple-data computational model for epex fortran". Parallel Computing, 7:11-24, 1988.] .

; Multiple Program Multiple Data (MPMD): Multiple autonomous processors simultaneously operating at least 2 independent programs. Typically such systems pick one node to be the "host" ("the explicit host/node programming model") or "manager" (the "Manager/Worker" strategy), which runs one program that farms out data to all the other nodes which all run a second program. Those other nodes then return their results directly to the manager.

Even further subdivisions are sometimes considered [http://www.tc.cornell.edu/Services/Education/Topics/Parallel/Distributed/+9.2+Strategies.htm ] .

References

External links

* [http://arith.stanford.edu/~flynn Michael J. Flynn]