Lecture 12 parallel processing architectures
This presentation is the property of its rightful owner.
Sponsored Links
1 / 10

Lecture 12 Parallel Processing Architectures PowerPoint PPT Presentation


  • 71 Views
  • Uploaded on
  • Presentation posted in: General

Lecture 12 Parallel Processing Architectures. Lecture 12: Parallel Processing Architectures. In this lecture, we will study Pipeline and parallel processing Pipeline Architecture and Vector Architecture Classification of Computer Architectures SISD SIMD MISD MIMD.

Download Presentation

Lecture 12 Parallel Processing Architectures

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Lecture 12 parallel processing architectures

Lecture 12Parallel Processing Architectures

Parallel Processing Architectures


Lecture 12 parallel processing architectures1

Lecture 12: Parallel Processing Architectures

In this lecture, we will study

  • Pipeline and parallel processing

  • Pipeline Architecture and Vector Architecture

  • Classification of Computer Architectures

    • SISD

    • SIMD

    • MISD

    • MIMD

Parallel Processing Architectures


Parallel processing

  • A system with p copies of A will complete the jobs in m/p x n

  • seconds

Parallel Processing

  • A job requires n seconds to complete using machine A:

  • There are m(m is a large number) jobs which need to be completed.

  • A will complete the jobs in m x n seconds

  • Machine A can be organized with h stages, A1, A2, … , Ah, with identical processing delay such that

    • When the task j in job i completes in stage Aj,

      • Job i enters the stage j+1 to execute the task j+1, and

      • Job i+1 enters from Aj-1 to Aj to execute the task j

This is a pipeline execution and it will, on the average, complete

a job in every delay of the pipeline stage. Thus, m jobs will be

completed in

(n/h) x (h-1) + (n/h) x m seconds

Parallel Processing Architectures


Parallel processing1

P0

P1

Pn-1

. . .

Parallel Processing

Instruction execution time remain same as ordinary single computer.

Throughput - amount work done in a unit time

Throughput becomes n times the single processor

Parallel Processing Architectures


Pipeline prcessor

Processor

S0

S1

S2

S3

S4

Time 01 23 45 67 89 1011 ...

I0 I01I02 I03I04 I05

I1I11 I12I13 I14I15

I2 I21I22 I23I24 I25

I3I31 I32I33 I34I35

I4 I41I42 I43I44 I45

I5I51 I52I53 I54I55

I6 I61I62 I63I64 I65

I7I71 I72I73 I74I75

I8 I81I82 I83I84 ...

... . . .

Completion I0I1 I2I3 I4I5 I6I7...

Pipeline Prcessor

Instruction execution time remain same as ordinary single computer.

But effective instruction execution time becomes delay of a pipeline stage.

Parallel Processing Architectures


Vector processor

Input/Output

Data Bus

Control Processor

Processor

Control Memory

PE0 PE1 PEn-1

. . .

Processor

Processor

Processor

Local Memory

Local Memory

Local Memory

Control

Interconnection Network

Vector Processor

Parallel Processing Architectures


Pipeline processor

Scalar

Processor

SP1

SP2

Scalar

Register

File

. . .

Scalar

Fetch

Vector

Fetch

SPn

Scalar Pipeline

Memory

IF ID OF

Input/Output

Vector

Processor

VP1

Vector

Register

File

VP2

. . .

VPn

Vector Pipeline

Pipeline Processor

Parallel Processing Architectures


Classification of computer architecture

Classification of Computer Architecture

  • Flynn’s classification

    Instruction Stream

    • Continuous instruction sequence executed by a processor

      Data Stream

    • Continuous data sequence processed by a processor

  • SISD

  • SIMD

  • MISD

  • MIMD

Parallel Processing Architectures


Sisd and simd

IS

PU

IS

DS

CU

P

M

Common Memory

DS

PU1

MM1

DS

PU2

MM2

IS

CU

. . .

. . .

DS

PUn

MMm

IS

SISD and SIMD

  • SISD

  • SIMD

Parallel Processing Architectures


Misd and mimd

IS1

IS1

CU1

PU1

IS2

IS2

CU2

PU2

Common Memory

...

...

ISn

ISn

MM1

MMm

MM2

...

CUn

PUn

DS

ISn ...

IS2

IS1

IS1

IS1

DS1

Common M

CU1

PU1

IS1

MM1

IS2

IS2

DS2

IS2

CU2

PU2

MM2

...

...

...

ISn

ISn

DSn

CUn

PUn

ISn

MMn

MISD and MIMD

  • MISD

  • MIMD

Parallel Processing Architectures


  • Login