Presentation is loading. Please wait.

Presentation is loading. Please wait.

ECS 154B Computer Architecture II Spring 2009

Published byΣίβύλλα Βάμβας Modified over 6 years ago

Similar presentations

Presentation on theme: "ECS 154B Computer Architecture II Spring 2009"— Presentation transcript:

1 ECS 154B Computer Architecture II Spring 2009
Pipelining Datapath and Control § Partially adapted from slides by Mary Jane Irwin, Penn State And Kurtis Kredo, UCD

2 Data Forwarding Take the result from the earliest point that it exists in any of the pipeline state registers and forward it to the functional units (e.g., the ALU) that need it that cycle For ALU functional unit: the inputs can come from any pipeline register rather than just from ID/EX by adding multiplexors to the inputs of the ALU connecting the Rd write data in EX/MEM or MEM/WB to either (or both) of the EX’s stage Rs and Rt ALU mux inputs adding the proper control hardware to control the new muxes Other functional units may need similar forwarding logic With forwarding, the CPU can achieve a CPI of 1 even in the presence of data dependencies

3 Data Forwarding Conditions
Only forward when state changes Use RegWrite control signal Don’t forward if destination is $0 Forward if previous destination current source Forwarding unnecessary in other cases Forward if either source register needs it

4 EX/MEM Forwarding Register value needed by next instruction
Calculated by ALU this clock cycle Needed as input to ALU on next clock cycle ALU IM Reg DM add $4, $5, $6 add $8, $4, $7 or add $8, $7, $4 ALU IM Reg DM

5 EX/MEM Forwarding R[Rs] R[Rt] Immediate Rd Rt ID/EX EX/MEM MEM/WB
RegWrite R[Rs] ALU MemWrite MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt RegDst

6 EX/MEM Forwarding R[Rs] R[Rt] Immediate Rd Rt Rs ID/EX EX/MEM MEM/WB
RegWrite ALU MemWrite MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt Rs RegDst Forward Unit

7 MEM/WB Forwarding Register value needed two instructions later
Calculated by ALU this clock cycle Needed as input to ALU in two clock cycles ALU IM Reg DM add $4, $5, $6 ALU IM Reg DM Unrelated Instruction add $8, $4, $7 or add $8, $7, $4 ALU IM Reg DM

8 MEM/WB Forwarding R[Rs] R[Rt] Immediate Rd Rt Rs ID/EX EX/MEM MEM/WB
RegWrite ALU MemWrite MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt Rs RegDst Forward Unit

9 MEM/WB Forwarding R[Rs] R[Rt] Immediate Rd Rt Rs ID/EX EX/MEM MEM/WB
RegWrite ALU MemWrite MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt Rs RegDst Forward Unit

10 Forwarding Complication
Forward unit must forward most recent value It may appear necessary to do MEM/WB and EX/MEM forwarding simultaneously Only do EX/MEM forwarding this cycle Do EX/MEM forwarding again next cycle ALU IM Reg DM add $4, $5, $6 ALU IM Reg DM add $4, $4, $13 ALU IM Reg DM add $8, $4, $7

11 Complete ALU Input Forwarding
ID/EX EX/MEM MEM/WB R[Rs] RegWrite ALU MemWrite MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt Rs RegDst Forward Unit

12 Register Definition How can we specify a particular signal?
Each state register has a copy May vary across stages Reference the register that contains the value RegWrite value in EX/MEM state register EX/MEM.RegWrite RegWrite value in MEM/WB state register MEM/WB.RegWrite

13 Forwarding Conditions
We want to forward when Previous instruction updates state Previous destination used as current source Previous destination not $0 Data Hazard code add $4, $5, $6 sub $8, $4, $9 How do we do this in hardware?

14 Forwarding Unit R[Rs] R[Rt] Immediate Rd Rt Rs ID/EX EX/MEM MEM/WB
RegWrite ALU MemWrite MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt Rs RegDst Forward Unit

15 Forwarding Unit Details
EX/MEM.RegWrite Forward EX/MEM.RegisterRd[4] ID/EX.RegisterRs[4] … EX/MEM.RegisterRd = ID/EX.RegisterRs EX/MEM.RegisterRd[0] ID/EX.RegisterRs[0] EX/MEM.RegisterRd[4] … EX/MEM.RegisterRd[0] EX/MEM.RegisterRd ≠ 0

16 Other Forwarding Possible
Forwarding to Data Memory Data memory to data memory copy ALU IM Reg DM add $4, $5, $6 ALU IM Reg DM sw $4, 40($7) ALU IM Reg DM lw $4, 16($7) ALU IM Reg DM sw $4, 40($7)

17 Forwarding to Memory What happens here?
add $5, $6, $7 sw $5, 8($10) Forwarding must occur, but not through ALU

18 Forwarding to Memory R[Rs] R[Rt] Immediate Rd Rt Rs ID/EX EX/MEM
MEM/WB MemWrite R[Rs] RegWrite ALU MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt Rs Forward Unit

19 Forwarding to Memory R[Rs] R[Rt] Immediate Rd Rt Rs ID/EX EX/MEM
MEM/WB MemWrite R[Rs] RegWrite ALU MemtoReg R[Rt] ALU Cntrl Immediate Rd Rt Rs Forward Unit

20 Load Use Hazards Require Stalls
No forwarding can help Requires a Hazard Detection Unit Detects hazards Inserts pipeline bubble ALU IM Reg DM lw $4, 16($5) nop ALU IM Reg DM add $8, $4, $7

21 Stalling The Pipeline Stalls occur by inserting pipeline bubble
Hold some state registers (stage repeats) Allow other stages to continue processing ALU IM Reg DM lw $4, 16($5) ALU IM Reg DM add becomes nop Repeats ALU IM Reg DM add $8, $4, $7

22 Stalling The Pipeline Load Use Hazard code lw $4, 16($5)
add $8, $4, $7 ALU IM Reg DM add lw

23 Stalling The Pipeline Load Use Hazard code lw $4, 16($5)
add $8, $4, $7 ALU IM Reg DM Hazard Detected add lw

24 Stalling The Pipeline Load Use Hazard code lw $4, 16($5)
add $8, $4, $7 Stage Repeated IM Reg DM Reg Bubble Inserted add nop lw

25 Stalling The Pipeline Load Use Hazard code lw $4, 16($5)
add $8, $4, $7 Data Forwarded IM Reg ALU Reg add nop lw

26 Stalling The Pipeline Load Use Hazard code lw $4, 16($5)
add $8, $4, $7 No Register Written IM Reg ALU DM add nop

27 How To Stall The Pipeline
Two ways to stall the pipeline Set control signals to safe values Change instruction Set control signals All control signals become 0 Only MemWrite and RegWrite need to be 0 Change the instruction Make destination register $0 MIPS nop = 0x (sll $0, $0, 0)

28 How To Stall The Pipeline
Control Write Data Read Addr 1 Read Addr 2 Write Addr Register File Read Data 1 Data 2 Read Address IM PC IF/ID ID/EX

29 How To Stall The Pipeline
Hazard Detection Control IF/IDWrite MemRead PCWrite Write Data Read Addr 1 Read Addr 2 Write Addr Register File Read Data 1 Data 2 Read Address IM PC IF/ID Rt ID/EX

30 Hazard Detection Details
Stall pipeline when all of the following occur ID/EX.MemRead ID/EX.RegisterRt ≠ 0 ID/EX.RegisterRt = IF/ID.RegisterRs or ID/EX.RegisterRt = IF/ID.RegisterRt

31 Control Hazard Review Caused when next instruction is unknown
Conditional branch result unknown Unconditional branch before destination calculated ALU IM Reg DM ALU IM Reg DM ALU IM Reg DM ALU IM Reg DM

32 Control Hazards No simple way to handle control hazards
Stalls often required Incorrect guesses lead to wasted cycles Forwarding handles most data hazards Decreases CPI to nearly 1 for data hazards Only specific situations require a stall Thankfully, control hazards occur less frequently

33 Stalling Control Hazards
Stalling always possible, but affects CPI ALU IM Reg DM ALU IM Reg DM ALU IM Reg DM ALU IM Reg DM

34 CPU May Assume Branch Not Taken
Always assume branch is not taken No delay if branch not taken ALU IM Reg DM beq $4, $5, label ALU IM Reg DM add $7, $8, $9 label:

35 Branch Delay A taken branch must flush instructions beq $4, $5, label
add $7, $8, $9 or $10, $11, $12 … label: sub $7, $8, $9 ALU IM Reg DM Incorrect Branch or add beq

36 Branch Delay A taken branch must flush instructions beq $4, $5, label
add $7, $8, $9 or $10, $11, $12 … label: sub $7, $8, $9 IM DM Reg sub nop nop beq

37 Adding nop To Decode Stage
Clears Execute Stage Hazard Detection Control Read Address IM Write Data Read Addr 1 Read Addr 2 Write Addr Register File Read Data 1 Data 2 PC IF/ID ID/EX Clears Decode Stage

38 Reducing Branch Delay Reduce delay by computing branch in Decode
Comparison hardware required Stage longer: read Register File, then compare Branch destination adder moved to Decode Only removes one stall Forwarding logic required add $4, $5, $6 or $9, $10, $3 beq $4, $7, label ALU IM Reg DM ALU IM Reg DM ALU IM Reg DM

39 Branch Delay in Deep Pipelines
Deeper pipelines incur larger delay Branch Decision Stage Stage 1 Stage 2 Stage 3 Stage 4 Stage 5 Four Stalls Required Stage 1 Stage 2 Stage 3 Stage 4 Stage 5

40 Dynamic Branch Prediction
For deep pipelines or superscalar CPUs static prediction too costly Decreasing transistor size means more room for other functionality Have CPU guess branch result based on history of previous branches Branch Prediction Buffer: Table of instruction addresses and branch results Branch Target Buffer: Table of instruction addresses and branch destinations When instruction executed again, look at buffers to predict result and destination

41 Dynamic Branch Prediction
Branch Prediction Buffer 0x4C T, N, T, N, N, N 0x84 T, T, T, N, T, N 0xF8 T, N, N, N, N, T Branch Target Buffer 0x4C 0x C 0x84 0x501FF524 0xF8 0x500CD300 Only lower portion of address used Branch history depth depends on implementation Only lower portion of address used Branch destination

42 Dynamic Branch Prediction
When prediction correct no delay occurs Pipeline remains full CPI remains near 1 When prediction incorrect Flush instructions currently in pipeline Fetch correct instruction CPI increases above 1

43 1-bit Branch Prediction
CPU uses last branch result as prediction for: add $4, $5, $9 … addi $8, $8, -1 bne $8, $0, for Loop executes 10 times First time prediction incorrect (predicted not taken) 2-9 predictions correct (taken) Last time prediction incorrect (predicted taken) Short history causes incorrect predictions Branch almost always taken Predicted incorrect at least twice

44 2-bit Branch Prediction
Require two consecutive wrong answers to change prediction Taken Not Taken Predict Taken Predict Taken Taken Taken Not Taken Not Taken Predict Not Taken Predict Not Taken Taken Not Taken

45 2-bit Branch Prediction
Previous example for: add $4, $5, $9 … addi $8, $8, -1 bne $8, $0, for 2-bit Prediction better First prediction correct 2-9 predictions correct Last prediction incorrect Improves to one incorrect per loop Taken Not Taken Predict Taken Predict Taken Taken Taken Not Taken Not Taken Predict Not Taken Predict Not Taken Taken Not Taken

46 Other Branch Prediction Schemes
Many other ways to predict branch results Correlating predictor Maintain local history (per branch instruction) Maintain global history (for all branches) Use combination of histories to make prediction Tournament predictor Maintain multiple predictors per branch instruction Use selector to choose most accurate predictor

Download ppt "ECS 154B Computer Architecture II Spring 2009"

Similar presentations

Morgan Kaufmann Publishers The Processor

Morgan Kaufmann Publishers The Processor
ECE 445 – Computer Organization

ECE 445 – Computer Organization
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 ECE 313 - Computer Organization Pipelined Processor.

Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Pipelined Processor.
Part 2 - Data Hazards and Forwarding 3/24/04++

Part 2 - Data Hazards and Forwarding 3/24/04++
Review: MIPS Pipeline Data and Control Paths

Review: MIPS Pipeline Data and Control Paths
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( www.cse.psu.edu/~mji )www.cse.psu.edu/~mji www.cse.psu.edu/~cg431.

ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( www.cse.psu.edu/~mji )www.cse.psu.edu/~mji www.cse.psu.edu/~cg431.

ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania 18042 ECE 313 - Computer Organization Lecture 18 - Pipelined.

Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 18 - Pipelined.
1 1999 ©UCB CS 162 Computer Architecture Lecture 3: Pipelining Contd. Instructor: L.N. Bhuyan www.cs.ucr.edu/~bhuyan/cs162.

©UCB CS 162 Computer Architecture Lecture 3: Pipelining Contd. Instructor: L.N. Bhuyan
1 Stalling  The easiest solution is to stall the pipeline  We could delay the AND instruction by introducing a one-cycle delay into the pipeline, sometimes.

1 Stalling  The easiest solution is to stall the pipeline  We could delay the AND instruction by introducing a one-cycle delay into the pipeline, sometimes.
 The actual result $1 - $3 is computed in clock cycle 3, before it’s needed in cycles 4 and 5  We forward that value to later instructions, to prevent.

 The actual result $1 - $3 is computed in clock cycle 3, before it’s needed in cycles 4 and 5  We forward that value to later instructions, to prevent.
Computer Organization Lecture Set – 06 Chapter 6 Huei-Yung Lin.

Computer Organization Lecture Set – 06 Chapter 6 Huei-Yung Lin.
Lecture 28: Chapter 4 Today’s topic –Data Hazards –Forwarding 1.

Lecture 28: Chapter 4 Today’s topic –Data Hazards –Forwarding 1.
Control Hazards.1 Review: Datapath with Data Hazard Control Read Address Instruction Memory Add PC 4 Write Data Read Addr 1 Read Addr 2 Write Addr Register.

Control Hazards.1 Review: Datapath with Data Hazard Control Read Address Instruction Memory Add PC 4 Write Data Read Addr 1 Read Addr 2 Write Addr Register.
1 Stalls and flushes  So far, we have discussed data hazards that can occur in pipelined CPUs if some instructions depend upon others that are still executing.

1 Stalls and flushes  So far, we have discussed data hazards that can occur in pipelined CPUs if some instructions depend upon others that are still executing.
Chapter 4B: The Processor, Part B. Review: Why Pipeline? For Performance! I n s t r. O r d e r Time (clock cycles) Inst 0 Inst 1 Inst 2 Inst 4 Inst 3.

Chapter 4B: The Processor, Part B. Review: Why Pipeline? For Performance! I n s t r. O r d e r Time (clock cycles) Inst 0 Inst 1 Inst 2 Inst 4 Inst 3.
Pipeline Data Hazards: Detection and Circumvention Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from slides kindly.

Pipeline Data Hazards: Detection and Circumvention Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from slides kindly.
Pipelined Datapath and Control

Pipelined Datapath and Control
CPE432 Chapter 4B.1Dr. W. Abu-Sufah, UJ Chapter 4B: The Processor, Part B-2 Read Section 4.7 Adapted from Slides by Prof. Mary Jane Irwin, Penn State University.

CPE432 Chapter 4B.1Dr. W. Abu-Sufah, UJ Chapter 4B: The Processor, Part B-2 Read Section 4.7 Adapted from Slides by Prof. Mary Jane Irwin, Penn State University.
Chapter 4 CSF 2009 The processor: Pipelining. Performance Issues Longest delay determines clock period – Critical path: load instruction – Instruction.

Chapter 4 CSF 2009 The processor: Pipelining. Performance Issues Longest delay determines clock period – Critical path: load instruction – Instruction.

Similar presentations

Ads by Google