1 / 13

Flynn’s Taxonomy of Computer Architectures Source: Wikipedia

Flynn’s Taxonomy of Computer Architectures Source: Wikipedia. Michael Flynn 1966 CMPS 5433 – Parallel Processing. Flynn’s Taxonomy . Proposed in 1966 General 4 category system Does not clearly classify all models in use today There are combinations, also. Four Categories - Terminology.

jolanta
Télécharger la présentation

Flynn’s Taxonomy of Computer Architectures Source: Wikipedia

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Flynn’s Taxonomyof Computer ArchitecturesSource: Wikipedia Michael Flynn 1966 CMPS 5433 – Parallel Processing

  2. Flynn’s Taxonomy • Proposed in 1966 • General 4 category system • Does not clearly classify all models in use today • There are combinations, also.

  3. Four Categories - Terminology • S = Single • I = Instruction Stream • M = Multiple • D = Data Stream • SISD • SIMD • MISD • MIMD

  4. SISD • Single Instruction, Single Data stream • A sequential computer which exploits no parallelism in either the instruction or data streams. Examples of SISD architecture are the traditional single processor machines like a PC (currently manufactured PC's have multiple processors) or old mainframes.

  5. SISD

  6. SIMD • Single Instruction, Multiple Data streams • Exploits multiple data streams against a single instruction stream to perform operations which may be naturally parallelized. • For example, an array processor or GPU. • Typical for splitting large data sets.

  7. SIMD

  8. NOTE: Front-end processor • ONE processor starts the program • It sends code to the other processors • In diagrams, the front-end is represented by which sends code to individual PU’s which execute the remaining code. Instruction Pool PU

  9. SIMD Code • Each processor executes the same code • Code may be variable based on processor id • Example: Sum elements of array A for each Pi, i = 0 to 9 // “executed” by front-end Ti = 0 for j = 0 to 9 // Pi sums its segment Ti = Ti + A[i * 10 + j]

  10. MISD • Multiple Instruction, Single Data stream • Multiple instructions operate on a single data stream. Uncommon architecture which is generally used for fault tolerance. • Systolic Array: process data & pass on to next PU • Examples include the Space Shuttle flight control computer. • Least common

  11. MISD

  12. MIMD • Multiple Instruction, Multiple Data streams • Multiple autonomous processors simultaneously executing different instructions on different data. • May send results to central location. • Distributed systems – can be shared memory space or distributed memory space.

  13. MIMD

More Related