Scribd
Upload
221 views8 pages

Flynn

Flynn's taxonomy is a classification of computer architectures, proposed by Michael J. Flynn in 1966 and extended in 1972. The classification system has stuck, and it has been used as a tool in the design of modern processors and their functionalities.

Uploaded by

Ravi Raj Shrivastava
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
221 views8 pages

Flynn

Flynn's taxonomy is a classification of computer architectures, proposed by Michael J. Flynn in 1966 and extended in 1972. The classification system has stuck, and it has been used as a tool in the design of modern processors and their functionalities.

Uploaded by

Ravi Raj Shrivastava
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

ARCHITECTURAL CLASSIFICATION

 Flynn classification: (1966) is based on


multiplicity of instruction streams and the data
streams in computer systems.

 Feng’s classification: (1972) is based on serial


versus parallel processing.

 Handler’s classification: (1977) is determined


by the degree of parallelism and pipelining in
various subsystem levels.
FLYNN’S TAXONOMY OF COMPUTER
ARCHITECTURE…
 The most popular taxonomy of computer
architecture was defined by Flynn in 1966.

 Flynn’s classification scheme is based on the notion


of a stream of information. Two types of information
flow into a processor: instructions and data.

 The instruction stream is defined as the sequence of


instructions performed by the processing unit.

 The data stream is defined as the data traffic


exchanged between the memory and the
processing unit.
Types of FLYNN’S TAXONOMY
 to Flynn’s classification, either of
the instruction or data streams
can be single or multiple.
Computer architecture can be
classified into the following four
distinct categories:

 single-instruction single-data
streams (SISD);
 single-instruction multiple-data
streams (SIMD);
 multiple-instruction single-data
streams (MISD); and
 multiple-instruction multiple-
data streams (MIMD).
SISD
 Conventional single-processor von Neumann
computers are classified as SISD systems.
SIMD ARCHITECTURE
 The SIMD model of parallel
computing consists of two
parts: a front-end computer
of the usual von Neumann
style, and a processor array.

 The processor array is a set


of identical synchronized
processing elements
capable of simultaneously
performing the same
operation on different data.
MIMD ARCHITECTURE
 Multiple-instruction multiple-data streams
(MIMD) parallel architectures are made of
multiple processors and multiple memory
modules connected together via some
interconnection network. They fall into two
broad categories: shared memory or
message passing.
 Processors exchange information through
their central shared memory in shared
memory systems, and exchange information
through their interconnection network in
message passing systems.
MISD ARCHITECTURE
 In the MISD category, the
same stream of data
flows through a linear
array of processors
executing different
instruction streams.
 In practice, there is no
viable MISD machine;
however, some authors
have considered
pipelined machines (and
perhaps systolic-array
computers) as examples
for MISD.

You might also like