Flynn’s Classification refers to a classification of parallel computer architectures. Parallel computers can be classified by the concurrency in processing sequences (streams), data, or instructions from the perspective of an assembly language programmer.
In this article, we will dive deeper into Flynn’s Classification of Computers according to the GATE Syllabus for (Computer Science Engineering) CSE. Keep reading ahead to learn more.
Table of Contents
What is Flynn’s Classification of Computers?
M.J. Flynn offered a classification for a computer system’s organisation based on the number of instructions as well as data items that are changed at the same time.
An instruction stream is a collection of instructions read from memory. A data stream is the result of the actions done on the data in the processor.
The term ‘stream’ refers to the flow of data or instructions.
Parallel processing can happen in the data stream, the instruction stream, or both.
Flynn’s Classification
Computers can be divided into the following major groups according to Flynn’s Classification:
SISD
It depicts the structure of a single computer, which includes a control unit, a memory unit, and a processor unit. Read more on SISD here.
SIMD
It symbolises an organisation with a large number of processing units overseen by a central control unit. Read more on SIMD here.
MISD
Because no real system has been built using the MISD structure, it is primarily of theoretical importance. Read more on MISD here.
MIMD
All processors of a parallel computer could execute distinct instructions and act on different data at the same time in this configuration. Read more on MIMD here.
Keep learning and stay tuned to get the latest updates on GATE Exam along with GATE Eligibility Criteria, GATE 2023, GATE Admit Card, GATE Syllabus, GATE Previous Year Question Paper, and more.
Also Explore,
- Types of Instructions in Computer Architecture
- ALU (Arithmetic Logic Unit)
- Control Unit
- Microprogrammed Control Unit
- Instruction Formats
- Addressing Modes
- Memory Hierarchy
- Fully Associative Mapping
- Associative Mapping
- Direct Mapping
- Conversion of Bases to Other Bases
- SIMD
- SISD
- MIMD
- MISD
- De Morgan’s Theorems
Comments