dependencies and hazards
play

Dependencies and Hazards Lecture 17 CS301 Data Dependencies We - PowerPoint PPT Presentation

Mar 20, 2024 •128 likes •1.35k views

Dependencies and Hazards Lecture 17 CS301 Data Dependencies We want to keep the pipeline completing an instruction every cycle When a later instruction depends on the result of an earlier instruction, stalls happen There are 3

  1. Barriers to Pipeline Performance • Uneven stages • Pipeline register delays • Data Hazards • Control Hazards w Whether an instruction will execute depends on the outcome of a conditional branch still in the pipeline

  2. Control Hazard In what cycle does the nextPC get calculated for the bne? End of 4 In what cycle does the or get fetched? Beginning of 3 IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end IF ID MEM WB or $s3, $s0, $t3 IF IF IF ID MEM WB end: sw $s2, 0($t1) 1 2 3 4 5 6 7 8 Time->

  3. Solution 1: Add hardware to determine branch in decode stage In what cycle does the nextPC get calculated for the bne? End of 4 In what cycle does the or get fetched? Beginning of 3 IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end IF ID MEM WB or $s3, $s0, $t3 IF IF IF ID MEM WB end: sw $s2, 0($t1) 1 2 3 4 5 6 7 8 Time->

  4. Pipelined Machine Decode Execute Memory Fetch << << 4 2 2 Addr Out Data src1 src1data op/fun PC Read Addr Out Data rs Data Memory src2 src2data Instruction rt Register File Memory rd destreg imm In Data destdata Sign 16 32 Ext (Writeback) Pipeline Register

  5. Solution 1: Add hardware to determine branch in decode stage In what cycle does the nextPC get calculated for the bne? 3 In what cycle does the or get fetched? 3 IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end IF IF ID MEM WB or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  6. Note • For the rest of this course, the branches will be determined in the decode stage • All other optimizations will be in addition to moving branch calculation to decode stage

  7. Solution 2: Branch Delay Slot Redefine the semantics of a branch: ALWAYS execute the instruction after the branch, regardless of the outcome of the branch. IF ID MEM WB add $s5, $s4, $t1 bne $s0, $s1, end IF ID MEM WB nop MEM WB IF ID EX IF ID MEM WB or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  8. Solution 2: Also add Branch Delay Slot ALWAYS execute the instruction after the branch, regardless of the outcome of the branch. Try to fill that spot with an instruction from before the branch. bne $s0, $s1, end IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB IF ID MEM WB or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  9. Branch Delay Slot • The hardware always executes instruction after a branch • The compiler tries to take an instruction from before branch and move it after branch • If it can find no instruction, it inserts a nop after the branch • If it forgets to place nop or inst there, you can get incorrect execution!!!!!

  10. Branch Delay Slot - Limitations • If you have a machine with 20 pipeline stages, and it takes 10 stages to calculate branch, how many branch delay slots are there? • Can you move any instruction into branch delay slot? • What happens as the pipeline gets deeper?

  11. Branch Delay Slot - Limitations • If you have a machine with 20 pipeline stages, and it takes 10 stages to calculate branch, how many branch delay slots are there? 9 • Can you move any instruction into branch delay slot? • What happens as the pipeline gets deeper?

  12. Branch Delay Slot - Limitations • If you have a machine with 20 pipeline stages, and it takes 10 stages to calculate branch, how many branch delay slots are there? 9 • Can you move any instruction into branch delay slot? Only independent instructions • What happens as the pipeline gets deeper?

  13. Branch Delay Slot - Limitations • If you have a machine with 20 pipeline stages, and it takes 10 stages to calculate branch, how many branch delay slots are there? 9 • Can you move any instruction into branch delay slot? Only independent instructions • What happens as the pipeline gets deeper? More difficult to fill slots • Branch delay slot is only used in short pipelines!

  14. Solution 3: Branch Prediction Guess which way the branch will go before calculation occurs. Clean up if predictor is wrong. IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end IF IF ID MEM WB or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  15. Solution 3: Branch Prediction First: Always predict not taken If we are right, how many cycles do we stall? IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end IF ID MEM WB or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  16. Solution 3: Branch Prediction First: Always predict not taken If we are right, how many cycles do we stall? 0 IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end IF ID MEM WB or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  17. Solution 3: Branch Prediction First: Always predict not taken If we are wrong, then flush incorrect instruction(s) IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end MEM WB ID EX IF or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  18. Solution 3: Branch Prediction First: Always predict not taken If we are wrong, then flush incorrect instruction(s) How many cycles do we stall? IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end MEM WB ID EX IF or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  19. Solution 3: Branch Prediction First: Always predict not taken If we are wrong, then flush incorrect instruction(s) How many cycles do we stall? 1 IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end MEM WB ID EX IF or $s3, $s0, $t3 end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  20. Solution 3: Branch Prediction First: Always predict taken Why will this still result in a stall? IF ID MEM WB add $s5, $s4, $t1 IF ID MEM WB bne $s0, $s1, end MEM WB IF ID EX end: sw $s2, 0($t1) IF ID MEM WB 1 2 3 4 5 6 7 8 Time->

  21. Branch Prediction • If we’re going to predict taken, we need to know where to branch to earlier than when we determine where the branch actually goes to. w How?

  22. Branch Prediction • Understand the nature of programs • Are branch directions random? • If not, what will correlate? w Past behavior? w Previous branches’ behavior?

  23. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Is beq often taken or not taken? Is bne often taken or not taken?

  24. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Is beq often taken or not taken? Not Taken Is bne often taken or not taken?

  25. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Is beq often taken or not taken? Is beq often taken or not taken? Not Taken Is bne often taken or not taken? Is bne often taken or not taken? Taken Conclusion: We want a prediction that is unique to each branch. Look up prediction by PC

  26. First Branch Predictor Predict whatever happened last time Update the predictor for next time Predict Taken Predict Not Taken

  27. First Branch Predictor Predict whatever happened last time Update the predictor for next time T NT Predict Taken Predict Not Taken

  28. First Branch Predictor Predict whatever happened last time Update the predictor for next time T NT NT 1 0 T Predict Taken Predict Not Taken

  29. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 Prediction Reality NextState

  30. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 1 Prediction NT Reality T NextState 1

  31. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 1 1 Prediction NT T Reality T T NextState 1 1

  32. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 1 1 0 Prediction NT T T Reality T T NT NextState 1 1 0

  33. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 1 1 0 1 Prediction NT T T NT Reality T T NT T NextState 1 1 0 1

  34. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 1 1 0 1 1 Prediction NT T T NT T Reality T T NT T T NextState 1 1 0 1 1

  35. Branch Prediction When are we wrong????? for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 1 1 0 1 1 Prediction NT T T NT T T Reality T T NT T T NT NextState 1 1 0 1 1 0

  36. Branch Prediction When are we wrong????? First and last iteration of each loop for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 0 1 1 0 1 1 Prediction NT T T NT T T Reality T T NT T T NT NextState 1 1 0 1 1 0

  37. Two-bit Branch Predictor Must be wrong twice in a row to switch prediction Update the predictor for next time One wrong-> state 1 or 2, No wrong -> state 0 or 3 3 2 1 0 Predict Not Taken Predict Taken

  38. Two-bit Branch Predictor Must be wrong twice in a row to switch prediction Update the predictor for next time One wrong-> state 1 or 2, No wrong -> state 0 or 3 T NT 3 2 1 0 Predict Not Taken Predict Taken

  39. Two-bit Branch Predictor Must be wrong twice in a row to switch prediction Update the predictor for next time One wrong-> state 1 or 2, No wrong -> state 0 or 3 T NT NT 3 2 1 0 T Predict Not Taken Predict Taken

  40. Two-bit Branch Predictor Must be wrong twice in a row to switch prediction Update the predictor for next time One wrong-> state 1 or 2, No wrong -> state 0 or 3 T NT NT NT 3 2 1 0 T T Predict Not Taken Predict Taken

  41. Second Branch Predictor Must be wrong twice in a row to switch prediction Update the predictor for next time NT T NT NT NT 3 2 1 0 T T T Predict Not Taken Predict Taken

  42. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 Prediction Reality NextState

  43. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 3 Prediction T Reality T NextState 3

  44. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 3 3 Prediction T T Reality T T NextState 3 3

  45. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 3 3 2 Prediction T T T Reality T T NT NextState 3 3 2

  46. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 3 3 2 3 Prediction T T T T Reality T T NT T NextState 3 3 2 3

  47. Branch Prediction for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 3 3 2 3 3 Prediction T T T T T Reality T T NT T T NextState 3 3 2 3 3

  48. Branch Prediction When are we wrong????? for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 3 3 2 3 3 Prediction T T T T T T Reality T T NT T T NT NextState 3 3 2 3 3 2

  49. Branch Prediction When are we wrong????? Only when we exit the loop for(i; i<n;i++) slt $t1, $s2, $s3 do some work beq $t1, $0, end loop: do some work addi $s2, $s2, 1 slt $t1, $s2, $s3 bne $t1, $0, loop end: Iteration 1 2 … x 1 2 … y CurState 2 3 3 2 3 3 Prediction T T T T T T Reality T T NT T T NT NextState 3 3 2 3 3 2

  50. Simplest Branch Predictors • Memory indexed by lower portion of 01 address 11 PC 100........ 10110 00 00 • Entry contains few . bits specifying . . prediction 10 01 • Accessed in IF stage 11 00 so fetching of target occurs in next cycle

  51. Real Branch Predictors • TargetPC saved with predictor • Limited space, so different branches may map to the same predictor w Prediction may have been put there by another instruction with same low order address bits w errors? (Prediction is just that – not guarantee) • Prediction based on past behavior of several branches

  52. Advantages of Branch Prediction • No extra instructions • Highly predictable branches have no stalls • Works well with loops. • All hardware - no compiler necessary

  53. Disadvantages/Limits of Branch Prediction • Large penalty when wrong w Badly behaved branches kill performance • Only a few can be performed each cycle (only a problem in multi-issue machines) w May or may not get to this – it’s superscalar processors

  54. Minimizing Control Hazards

  55. Minimizing Control Hazards • Calculate branch in decode stage

  56. Minimizing Control Hazards • Calculate branch in decode stage • Branch delay slot

  57. Minimizing Control Hazards • Calculate branch in decode stage • Branch delay slot • Branch prediction

  58. CPI • CPI = ∑ ((% instr) × (cycles)) • How do hazards affect CPI? • How do branches affect CPI?

  59. CPI • CPI = ∑ ((% instr) × (cycles)) • How do hazards affect CPI? w Arithmetic instructions’ cycle time increases • How do branches affect CPI?

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

EE 457 Unit 6b Data Hazards 2 Data Hazards Consider the data dependencies in the following

EE 457 Unit 6b Data Hazards 2 Data Hazards Consider the data dependencies in the following

1 EE 457 Unit 6b Data Hazards 2 Data Hazards Consider the data dependencies in the following sequence SUB $2, $1, $3 The last four are all dependent on AND $12, $2, $5 register $2 OR $13, $6, $2 But because of pipelining

339 views • 32 slides
Data Hazards Consider the data dependencies in the following sequence SUB $2, $1, $3

Data Hazards Consider the data dependencies in the following sequence SUB $2, $1, $3

6b.1 6b.2 Data Hazards Consider the data dependencies in the following sequence SUB $2, $1, $3 The last four are all dependent on EE 457 Unit 6b AND $12, $2, $5 register $2 OR $13, $6, $2 But because of pipelining the ADD

330 views • 8 slides
The Challenge of Natural Hazards This PowerPoint will cover information on: Natural Hazards

The Challenge of Natural Hazards This PowerPoint will cover information on: Natural Hazards

The Challenge of Natural Hazards This PowerPoint will cover information on: Natural Hazards Tectonic Hazards Weather Hazards Climate Change NATURAL HAZARDS Natural hazards pose major risks to people and property Natural Hazards A

1.11k views • 61 slides
CSCI341 Lecture 36, Pipelining &amp; Hazards RECALL... RECALL... HAZARDS Data Hazards

CSCI341 Lecture 36, Pipelining &amp; Hazards RECALL... RECALL... HAZARDS Data Hazards

CSCI341 Lecture 36, Pipelining &amp; Hazards RECALL... RECALL... HAZARDS Data Hazards Control Hazards Dukes of Hazzard DATA HAZARD Hardware solution: Include forwarding paths in the machines datapath. Even though results have not

436 views • 27 slides
Health Hazards in Construction Health Hazards Potential exposures to health hazards: Worker

Health Hazards in Construction Health Hazards Potential exposures to health hazards: Worker

Health Hazards in Construction Health Hazards Potential exposures to health hazards: Worker on the job Workers family Source: OSHA Objectives 1. Identify common health hazards. 2. Describe types of common health hazards. 3. Apply

320 views • 27 slides
Task Dependencies: ant Steven J Zeil February 25, 2013 Task Dependencies: ant Outline

Task Dependencies: ant Steven J Zeil February 25, 2013 Task Dependencies: ant Outline

Task Dependencies: ant Task Dependencies: ant Steven J Zeil February 25, 2013 Task Dependencies: ant Outline The ant Command 1 Build Files 2 Targets Properties File Sets and Lists Path Sets Filters Tasks Case Studies 3

807 views • 59 slides
Dependences and Hazards Lecture 17 CS301 Administrative Daily Review of todays lecture

Dependences and Hazards Lecture 17 CS301 Administrative Daily Review of todays lecture

Dependences and Hazards Lecture 17 CS301 Administrative Daily Review of todays lecture w Due tomorrow (10/30) at 8am HW #7 due today at 5pm HW #8 assigned w Due 10/5 at 5pm Read Chapter 4.8-4.9 Data Dependencies We

1.41k views • 123 slides
Building stuff with monadic dependencies + unchanging dependencies + polymorphic dependencies +

Building stuff with monadic dependencies + unchanging dependencies + polymorphic dependencies +

Building stuff with monadic dependencies + unchanging dependencies + polymorphic dependencies + abstraction Neil Mitchell http://nmitchell.co.uk Building stuff with Shake Neil Mitchell http://shakebuild.com What is Shake? A Haskell

813 views • 49 slides
Key Points: Control Hazards Control hazards occur when we don t know what the next

Key Points: Control Hazards Control hazards occur when we don t know what the next

Key Points: Control Hazards Control hazards occur when we don t know what the next instruction is Caused by branches and jumps. Strategies for dealing with them Stall Guess! Leads to speculation Flushing the

657 views • 40 slides
EE 457 Unit 6c Control Hazards 2 Control Hazards Control (branch) hazards are named such

EE 457 Unit 6c Control Hazards 2 Control Hazards Control (branch) hazards are named such

1 EE 457 Unit 6c Control Hazards 2 Control Hazards Control (branch) hazards are named such because they deal with 40: BEQ $1,$3,28 issues related to program control 44: AND $12,$2,$5 instructions (branch, jump, 48: OR $13,$6,$2

704 views • 21 slides
Managing Dependencies and Runtime Security ActiveState Deminar Managing Dependencies and

Managing Dependencies and Runtime Security ActiveState Deminar Managing Dependencies and

Managing Dependencies and Runtime Security ActiveState Deminar Managing Dependencies and Runtime Security About ActiveState Track-record: 97% of Fortune 1000, 20+ years open source Polyglot: 5 languages - Python, Perl, Tcl, Go, Ruby

727 views • 47 slides
Occupational Health Hazards PPT-SM-OCPHLTHHAZ 1 V.A.0.0 Occupational Health Hazards Three

Occupational Health Hazards PPT-SM-OCPHLTHHAZ 1 V.A.0.0 Occupational Health Hazards Three

Occupational Health Hazards PPT-SM-OCPHLTHHAZ 1 V.A.0.0 Occupational Health Hazards Three classes of occupational health hazards include 1. Chemical hazards 2. Biological hazards 3. Physical hazards PPT-SM-OCPHLTHHAZ 2 V.A.0.0 Chemical

499 views • 22 slides
Continuous Updating How do you keep track of your LIBRARIES? How many DEPENDENCIES do you have

Continuous Updating How do you keep track of your LIBRARIES? How many DEPENDENCIES do you have

Continuous Updating How do you keep track of your LIBRARIES? How many DEPENDENCIES do you have in your project? Which LICENSES are your dependencies using? You dont know? Goldman Sachs sent a brilliant computer scientist to JAIL ! GPL

529 views • 42 slides
Key Points: Control Hazards Control hazards occur when we dont know what the next

Key Points: Control Hazards Control hazards occur when we dont know what the next

Key Points: Control Hazards Control hazards occur when we dont know what the next instruction is Caused by branches and jumps. Strategies for dealing with them Stall Guess! Leads to speculation Flushing the

570 views • 32 slides
Dependencies in Interval- -valued valued Dependencies in Interval Symbolic Data Symbolic Data

Dependencies in Interval- -valued valued Dependencies in Interval Symbolic Data Symbolic Data

Dependencies in Interval- -valued valued Dependencies in Interval Symbolic Data Symbolic Data Lynne Billard University of Georgia lynne@stat.uga.edu Tribute to Professor Edwin Diday: Paris, France; 5 September 2007 Naturally occurring

635 views • 44 slides
Natural Hazards Earthquakes Volcanoes Tsunamis Minimizing Damage Works Cited

Natural Hazards Earthquakes Volcanoes Tsunamis Minimizing Damage Works Cited

Slide 1 / 142 Slide 2 / 142 4th Grade Natural Hazards 2015-11-18 www.njctl.org Slide 3 / 142 Slide 4 / 142 Table of Contents Click on the topic to go to that section Natural Hazards Natural Hazards Earthquakes Volcanoes

657 views • 30 slides
Pipeline Hazards Hazard Condition that disrupts the orderly flow of instructions Requires

Pipeline Hazards Hazard Condition that disrupts the orderly flow of instructions Requires

Pipeline Hazards Hazard Condition that disrupts the orderly flow of instructions Requires special attention by hardware and/or software to maintain program correctness and performance Structural Hazards Contention for hardware

338 views • 17 slides
Hazards hazard : previous instruction blocks following instruction structural hazards

Hazards hazard : previous instruction blocks following instruction structural hazards

Hazards hazard : previous instruction blocks following instruction structural hazards required resource is busy data hazard wait for previous instruction to complete its data read/write control hazard deciding on

1.3k views • 32 slides
Exploring Local Hazard Mitigation Plans These materials were developed by CIRES Education &amp;

Exploring Local Hazard Mitigation Plans These materials were developed by CIRES Education &amp;

Lesson Slides Middle/High School Expo Lesson Exploring Local Hazard Mitigation Plans These materials were developed by CIRES Education &amp; Outreach at the University of Colorado Boulder. 1

372 views • 8 slides
Chapter 8 Further Topics in Moral Hazard 8.1 Efficiency Wages The aim of an incentive

Chapter 8 Further Topics in Moral Hazard 8.1 Efficiency Wages The aim of an incentive

Chapter 8 Further Topics in Moral Hazard 8.1 Efficiency Wages The aim of an incentive contract is to create a difference between the agent's expected payoff from right and wrong actions. Either with the stick of punishment or with

502 views • 27 slides
Lecture 17: Basic Pipelining Todays topics: 5-stage pipeline Hazards and

Lecture 17: Basic Pipelining Todays topics: 5-stage pipeline Hazards and

Lecture 17: Basic Pipelining Todays topics: 5-stage pipeline Hazards and instruction scheduling Mid-term exam stats: Highest: 90, Mean: 58 1 Multi-Cycle Processor Single memory unit shared by instructions and memory

703 views • 25 slides
Organization Lecture-11 CPU Design : Pipelining-2 Review, Hazards Shakil M. Khan IF for Load

Organization Lecture-11 CPU Design : Pipelining-2 Review, Hazards Shakil M. Khan IF for Load

CSE 2021: Computer Organization Lecture-11 CPU Design : Pipelining-2 Review, Hazards Shakil M. Khan IF for Load (Review) CSE-2021 July-19-2012 2 ID for Load (Review) CSE-2021 July-19-2012 3 EX for Load (Review) CSE-2021 July-19-2012 4

530 views • 38 slides
Municipal Borrowing Costs and State Policies for Distressed Municipalities Pengjie Gao, HKUST and

Municipal Borrowing Costs and State Policies for Distressed Municipalities Pengjie Gao, HKUST and

Municipal Borrowing Costs and State Policies for Distressed Municipalities Pengjie Gao, HKUST and University of Notre Dame Chang Lee, University of Illinois at Chicago Dermot Murphy, University of Illinois at Chicago July 2016 Gao, Lee, and

319 views • 31 slides
Previous Lecture Slides for Lecture 16 ENCM 501: Principles of Computer Architecture Winter 2014

Previous Lecture Slides for Lecture 16 ENCM 501: Principles of Computer Architecture Winter 2014

slide 2/26 ENCM 501 W14 Slides for Lecture 16 Previous Lecture Slides for Lecture 16 ENCM 501: Principles of Computer Architecture Winter 2014 Term context switches and effects on memory latency Steve Norman, PhD, PEng memory system

242 views • 5 slides

More recommend