Quiz $s0 – lw -> sw RAW $s1 – sub -> addRAW $s0 – lw -> add WAW $s0 – sw -> add WAR Identify the dependencies lw $s0, 0($t0) sw $s0, 100($t2) sub $s1,

Slides:



Advertisements
Similar presentations
Computer Architecture Lecture 3 – Part 2 15 th May, 2006 Abhinav Agarwal Veeramani V.
Advertisements

Pipeline Exceptions & ControlCSCE430/830 Pipelining in MIPS MIPS architecture was designed to be pipelined –Simple instruction format (makes IF, ID easy)
COMP381 by M. Hamdi 1 (Recap) Pipeline Hazards. COMP381 by M. Hamdi 2 I n s t r. O r d e r add r1,r2,r3 sub r4,r1,r3 and r6,r1,r7 or r8,r1,r9 xor r10,r1,r11.
Pipeline Example: cycle 1 lw R10,9(R1) sub R11,R2, R3 and R12,R4, R5 or R13,R6, R7.
Superscalars Lalitha Ramadoss Elec 6200 Computer Architetcure& Design Lectured by Dr.Vishwani Agrawal Electrical&computer Engineering Auburn.
Solution 2nd Exam.
Pipelining 6.1, 6.2. Performance Measurements Cycle Time: Time __________________ Latency: Time to finish a _____________, start to finish Throughput:
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Pipeline Hazards See: P&H Chapter 4.7.
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University RISC Pipeline See: P&H Chapter 4.6.
CSCE 212 Quiz 9 – 3/30/11 1.What is the clock cycle time based on for single-cycle and for pipelining? 2.What two actions can be done to resolve data hazards?
Lecture 28: Chapter 4 Today’s topic –Data Hazards –Forwarding 1.
Data Dependencies A dependency type that can cause a stall.
Computer Architecture - A Pipelined Datapath A Pipelined Datapath  Resisters are used to save data between stages. 1/14.
ENGS 116 Lecture 51 Pipelining and Hazards Vincent H. Berk September 30, 2005 Reading for today: Chapter A.1 – A.3, article: Patterson&Ditzel Reading for.
Christoph Höhne Michael Kaufmann.  Motivation  Super Scalar Architecture  Implementation Details  Annoying Hazards  Comparisons  Conclusion.
Pipeline Hazard CT101 – Computing Systems. Content Introduction to pipeline hazard Structural Hazard Data Hazard Control Hazard.
Memory/Storage Architecture Lab Computer Architecture Pipelining Basics.
Sample Code (Simple) Run the following code on a pipelined datapath: add1 2 3 ; reg 3 = reg 1 + reg 2 nand ; reg 6 = reg 4 & reg 5 lw ; reg.
Computer Architecture CSE 3322 Lecture 3 Assignment: 2.4.1, 2.4.4, 2.6.1, , Due 2/3/09 Read 2.8.
5/13/99 Ashish Sabharwal1 Pipelining and Hazards n Hazards occur because –Don’t have enough resources (ALU’s, memory,…) Structural Hazard –Need a value.
10/11: Lecture Topics Execution cycle Introduction to pipelining
PROCESSOR PIPELINING YASSER MOHAMMAD. SINGLE DATAPATH DESIGN.
Interstage Buffers 1 Computer Organization II © McQuain Pipeline Timing Issues Consider executing: add $t2, $t1, $t0 sub $t3, $t1, $t0 or.
MIPS Coding. Exercise – the bubble sort 7/9/2016week04-3.ppt2.
Pipeline Timing Issues
CS2100 Computer Organization
Pipelining: Hazards Ver. Jan 14, 2014
Basic Pipeline Datapath
MIPS instructions.
Test 2 review Lectures 5-10.
Single Clock Datapath With Control
Make Your Own Quiz.
ECE232: Hardware Organization and Design
ECE232: Hardware Organization and Design
. - t !!l t. - 1f1f J - /\/\ - ' I __.
Test 2 review Lectures 5-10.
Computer Architecture Lecture 3 – Part 1 11th May, 2006
Computer Architecture Lecture 3
Pipelining review.
Current Design.
Computer Organization CS224
Computer Architecture
Pipelining in more detail
Computer Architecture
Data Hazards Data Hazard
Pipelined Control (Simplified)
.. '.. ' 'i.., \. J'.....,....., ,., ,,.. '"'". ' · · f.. -··-·· '.,.. \...,., '.··.. ! f.f.
Pipeline control unit (highly abstracted)
The Processor Lecture 3.6: Control Hazards
Label Name Label Name Label Name Label Name Label Name Label Name
The Processor Lecture 3.5: Data Hazards
Daxia Ge Friday February 9th, 2007
Instruction Execution Cycle
Overview What are pipeline hazards? Types of hazards
Pipeline control unit (highly abstracted)
Vishwani D. Agrawal James J. Danaher Professor
/ Computer Architecture and Design
Pipelining: Basic Concepts
CS 286 Computer Architecture & Organization
Instruction Rescheduling and Loop-Unroll
pipelining: data hazards Prof. Eric Rotenberg
Pipeline Control unit (highly abstracted)
Reducing pipeline hazards – three techniques
Pipelining.
Appendix C Practice Problem Set 1
Throughput = #instructions per unit time (seconds/cycles etc.)
MIPS Pipelined Datapath
Problem ??: (?? marks) Consider executing the following code on the MIPS pipelined datapath: add $t5, $t6, $t8 add $t9, $t5, $t4 lw $t3, 100($t9) sub $t2,
Computer Architecture
Pipelining Hazards.
Presentation transcript:

Quiz $s0 – lw -> sw RAW $s1 – sub -> addRAW $s0 – lw -> add WAW $s0 – sw -> add WAR Identify the dependencies lw $s0, 0($t0) sw $s0, 100($t2) sub $s1, $s2, $s3 add $s0, $s1, $s3

Time-> IF ID IF ID MEM MEM WB Quiz IF ID MEMWB lw $s0, 0($t0) IF ID MEMWB sw $s0, 100($t2) sub $s1, $s2, $s3 add $s0, $s1, $s3

Quiz $s1 – lw -> add RAW $s1 – add -> sub RAW $s1 – lw -> add WAW $s3 – add -> sub WAR Identify the dependencies lw $s1, 0($t0) add $s1, $s1, $s3 sub $s3, $s1, $s4 bne $s3, $s4, label $s3 –sub -> bne RAW

Time-> IF ID IF ID MEM WB Quiz IF ID MEMWB lw $s1, 0($t0) IF ID MEMWB sub $s3, $s1, $s4 bne $s3, $s4, label add $s1, $s1, $s3 MEM D F F

Group Work add $t0, $s1, $s2 sub $t2, $s1, $s5 Lw $t1, 4 ($t0) add $t2, $t2, $t1 $t0 - RAW $t1 - RAW $t2 - RAW $t2 - WAW Identify the dependencies

Group Work add $t0, $s1, $s2 sub $t2, $s1, $s5 Lw $t1, 4 ($t0) add $t2, $t2, $t1 F1 F2DX1X2M1M2W F1 F2DX1X2M1M2W F1 F2DX1X2M1M2W F1F2D X1X2M1M2W D F2F2 F1F1 DD