Superscalars (Dynamic Multiple issue processors) - PowerPoint PPT Presentation

About This Presentation
Title:

Superscalars (Dynamic Multiple issue processors)

Description:

Title: Slide 1 Author: Vishwani Agrawal Last modified by: Preferred Customer Created Date: 8/9/2004 10:08:20 PM Document presentation format: On-screen Show (4:3) – PowerPoint PPT presentation

Number of Views:26
Avg rating:3.0/5.0
Slides: 14
Provided by: Vishwani3
Category:

less

Transcript and Presenter's Notes

Title: Superscalars (Dynamic Multiple issue processors)


1
Superscalars(Dynamic Multiple issue processors)
  • Yogesh Reddy Kondareddy

2
A quick review
  • Pipelining Divide datapath into nearly equal
    tasks, to be performed serially and requiring
    non-overlapping resources.
  • One instruction is executed per clock period.
  • Throughput Number of instructions executed in a
    clock period
  • 1
  • CPI 1

3
Instruction level parallelism (ILP)
  • Pipelining exploits the potential parallelism
    among instructions. This parallelism is called
    Instruction level parallelism (ILP).
  • Two methods to increase ILP
  • a) Increase the depth of pipelining
  • b) Replicate the internal components of the
    computer so that it can launch multiple
    instructions in every pipeline stage.
  • Consider the Automobile Assembly line example
    taught in the class..

4
Automobile Assembly Line
Task 2 1 hour
Task 3 1 hour
Task 4 1 hour
Task 1 1 hour
Mecahnical Electrical Painting Testing
First car assembled in 4 hours (pipeline
latency) thereafter 1 car per hour 21 cars on
first day, thereafter 24 cars per day 717 cars
per month 8,637 cars per year
5
Longer Assembly Line
Task 3 1/2 hour
Task 4 1/2 hour
Task 5 1/2 hour
Task 8 1/2 hour
Task 1 1/2 hour
Task 2 1/2 hour
Task 6 1/2 hour
Task 7 1/2 hour
Mechanical Mechanical Electrical
Electrical Painting Painting
Testing Testing
(Chassis) (Seats) (Lighting)
(Battery) (Body) (Rust
proof ) (Electrical ) (Mechanical)
First car assembled in 4 hours (pipeline
latency) thereafter 1 car per half an hour 41
cars on first day, thereafter 48 cars per
day 1433 cars per month 17,273 cars per year
6
Multiple Assembly Line
Task 2 1 hour
Task 3 1 hour
Task 4 1 hour
Task 1 1 hour
Mecahnical Electrical Painting Testing
Two cars are assembled in 4 hours (pipeline
latency) thereafter 2 cars per hour 42 cars on
the first day and thereafter 48 cars per day
1,432 cars per month 17,272 cars per year
7
Throughput Multiple Assembly Line
Mechanical Electrical Painting Testing

Car 1 Car 2 Car 3 Car 4 . .
Mechanical Electrical Painting Testing

Mechanical Electrical Painting Testing

Mechanical Electrical Painting Testing

Mechanical Electrical Painting Testing
Mechanical Electrical Painting Testing
Time (T)
Car 1 and 2 complete
Car 3 and 4 complete
Throughput m(1- (n - 1)/ T) cars per unit
time Throughput m as T?8
8
Comparison
  • Throughput of Single cycle 1/n
  • Throughput of Pipelining 1
  • Throughput of Superscalars m
  • n - Time unit (clock period).
  • m - Number of parallel datapaths.

9
Comparison
  • Single cycle CPI 1
  • Multi-cycle CPI gt 1
  • Pipelining CPI 1
  • Multiple issue pipelines CPI lt 1
  • Sometimes Instructions per Cycle (IPC) is used.
  • Todays high-end processors attempt to issue 3 to
    8 instructions in every clock cycle.

10
Issues
  • How does the processor determine how many
    instructions and which instructions to execute in
    parallel.
  • ex
  • lw t0, 1200 (t1)
  • sw t2, 1200 (t1)
  • 2. Dealing with data and control hazards.

11
Definitions
  • Multiple Issue
  • A scheme whereby multiple instructions are
    launched in 1 clock cycle.
  • Static multiple Issue
  • An approach to implementing a multiple-issue
    processor where many decisions are made by the
    compiler before execution.
  • Dynamic multiple Issue
  • An approach to implementing a multiple-issue
    processor where many decisions are made during
    execution by the processor. These are also called
    Superscalars.
  • Although these are considered two distinct
    approaches, in reality techniques from one
    approach are often borrowed by the other.

12
Dynamic scheduled Processors
IFID
RS
RS
RS
RS
FP
Int
Int
FP
Commit unit
13
References
  • Computer Organization Design The
    Hardware/Software Interface, 3rd Ed., D.A.
    Patterson J.L. Hennessy, Morgan Kaufmann
    Publishers (Elsevier), 2005.
  • Computer architecture a quantitative approach /
    David A. Patterson, John L. Hennessy with a
    contribution by David Goldberg.
  • http//en.wikipedia.org/wiki/Superscalar.
Write a Comment
User Comments (0)
About PowerShow.com