Instruction Execution

Similar documents
Revision MIPS Pipelined Architecture

Agenda. Single Cycle Performance Assume >me for ac>ons are 100ps for register read or write; 200ps for other events. Review: Single- cycle Processor

In Review: A Single Cycle Datapath We have everything! Now we just need to know how to BUILD CONTROL

COMP303 Computer Architecture Lecture 11. An Overview of Pipelining

P&H 4.51 Pipelined Control. 3. Control Hazards. Hazards. Stall => 2 Bubbles/Clocks Time (clock cycles) Control Hazard: Branching 4/15/14

CS152 Computer Architecture and Engineering Lecture 12. Introduction to Pipelining

CS152 Computer Architecture and Engineering Lecture 12. Introduction to Pipelining

Recap: Microprogramming. Specialize state-diagrams easily captured by microsequencer simple increment & branch fields datapath control fields

ECE4680 Computer Organization and Architecture. Hazards in a Pipeline Processor. Pipeline is good but you need be careful.

CENG 3420 Computer Organization and Design. Lecture 07: Pipeline Review. Bei Yu

Great Idea #4: Parallelism. CS 61C: Great Ideas in Computer Architecture. Pipelining Hazards. Agenda. Review of Last Lecture

ECE 361 Computer Architecture Lecture 13: Designing a Pipeline Processor

Digitalteknik och Datorarkitektur 5hp

CS420/520 Computer Architecture I

CS 61C: Great Ideas in Computer Architecture Control and Pipelining, Part II. Anything can be represented as a number, i.e., data or instrucwons

CS 61C: Great Ideas in Computer Architecture (Machine Structures) Instruc(on Level Parallelism: Mul(ple Instruc(on Issue

Load Instr 1. Instr 2 Instr 3. Instr 4. Outline & Announcements. EEL-4713C Computer Architecture Pipelined Processor - Hazards

Solutions to Supplementary Problems

CS61C Introduction to Pipelining. Lecture 25. April 28, 1999 Dave Patterson (http.cs.berkeley.edu/~patterson)

COMPSCI 230 Discrete Math Trees March 21, / 22

ALU. Announcements. Lecture 9. Pipeline Hazards. Review: Single-cycle Datapath (load instruction) Review: Multi-cycle Datapath. R e g s.

CDS 101: Lecture 7.1 Loop Analysis of Feedback Systems

ICS 233 Computer Architecture & Assembly Language

CS152 Computer Architecture and Engineering Lecture 12. Introduction to Pipelining

What Makes Production System Design Hard?

Period vs. Length of a Pendulum

CMP N 301 Computer Architecture. Appendix C

School of Electrical Engineering. Lecture 2: Wire Antennas

Kinetics. Central Force Motion & Space Mechanics

MOS transistors (in subthreshold)

Differential Kinematics

A Comparative Study and Analysis of an Optimized Control Strategy for the Toyota Hybrid System

Neural Networks The ADALINE

CS152 Computer Architecture and Engineering Lecture 12. Exceptions (continued) Introduction to Pipelining

CS:APP Chapter 4 Computer Architecture Pipelined Implementation

The angle between L and the z-axis is found from

(( ) ( ) ( ) ( ) ( 1 2 ( ) ( ) ( ) ( ) Two Stage Cluster Sampling and Random Effects Ed Stanek

STRIPLINES. A stripline is a planar type transmission line which is well suited for microwave integrated circuitry and photolithographic fabrication.

SOFTWARE. Computer Architecture Topics. Shared Memory, Message Passing, Data Parallelism. Network Interfaces. Interconnection Network

Physics 111. Lecture 38 (Walker: ) Phase Change Latent Heat. May 6, The Three Basic Phases of Matter. Solid Liquid Gas

EMPORIUM H O W I T W O R K S F I R S T T H I N G S F I R S T, Y O U N E E D T O R E G I S T E R.

Lecture 2: Frequency domain analysis, Phasors. Announcements

y cos x = cos xdx = sin x + c y = tan x + c sec x But, y = 1 when x = 0 giving c = 1. y = tan x + sec x (A1) (C4) OR y cos x = sin x + 1 [8]

Mid Year Examination F.4 Mathematics Module 1 (Calculus & Statistics) Suggested Solutions

Symmetry of Lagrangians of holonomic systems in terms of quasi-coordinates

Partial Fraction Expansion

Final Exam Solutions

Bit-Alignment for Retargetable Code Generators

Structural Hazard #1: Single Memory (1/2)! Structural Hazard #1: Single Memory (2/2)! Review! Pipelining is a BIG idea! Optimal Pipeline! !

Laplace Transformation

CS 6353 Compiler Construction, Homework #1. 1. Write regular expressions for the following informally described languages:

6. KALMAN-BUCY FILTER

sin sin 1 d r d Ae r 2

Michela Taufer CS:APP

From Elimination to Belief Propagation

Part II, Measures Other Than Conversion I. Apr/ Spring 1

CDS 101/110: Lecture 7.1 Loop Analysis of Feedback Systems

Helping you learn to save. Pigby s tips and tricks

ESCI 341 Atmospheric Thermodynamics Lesson 16 Pseudoadiabatic Processes Dr. DeCaria

Chemistry 222 DO NOT OPEN THE EXAM UNTIL YOU ARE READY TO TAKE IT! You may allocate a maximum of 80 continuous minutes for this exam.

INTRODUCTION TO AUTOMATIC CONTROLS INDEX LAPLACE TRANSFORMS

Y 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall

ORBITAL TO GEOCENTRIC EQUATORIAL COORDINATE SYSTEM TRANSFORMATION. x y z. x y z GEOCENTRIC EQUTORIAL TO ROTATING COORDINATE SYSTEM TRANSFORMATION

Then the number of elements of S of weight n is exactly the number of compositions of n into k parts.

Lecture 3.2: Cosets. Matthew Macauley. Department of Mathematical Sciences Clemson University

Review. Agenda. Dynamic Pipeline Scheduling. Specula>on. Why Do Dynamic Scheduling? 11/7/10

Payroll Direct Deposit

EXAMPLES 4/12/2018. The MIPS Pipeline. Hazard Summary. Show the pipeline diagram. Show the pipeline diagram. Pipeline Datapath and Control

Chapter 7 Dynamic stability analysis I Equations of motion and estimation of stability derivatives - 4 Lecture 25 Topics

WEEK 3 Effective Stress and Pore Water Pressure Changes

Near-Optimal Relay Station Placement for Power Minimization in WiMAX Networks

Overview. Real-World Pipelines: Car Washes. Computational Example. 3-Way Pipelined Version. Pipeline Diagrams

On the Hamiltonian of a Multi-Electron Atom

Investment. Net Present Value. Stream of payments A 0, A 1, Consol: same payment forever Common interest rate r

T-72: Saratoga to Coyne ENVIRONMENTAL SCREENING ACCESS PLAN

Estimation and Confidence Intervals: Additional Topics

ACCURATE FLOATING-POINT SUMMATION IN CUB

CHAPTER 5 CIRCULAR MOTION

Minimum Spanning Trees

Homework #7 Solution. Solutions: ΔP L Δω. Fig. 1

Problem Set 8 Solutions

Even/Odd Mode Analysis of the Wilkinson Divider

FI 3103 Quantum Physics

CBSE-XII-2013 EXAMINATION (MATHEMATICS) The value of determinant of skew symmetric matrix of odd order is always equal to zero.

EE 361L Fall 2010 Pipelined MIPS L0 (PMIPS L0) and Pipelined MIPS L (PMIPS L)

y = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b)

The Moúõ. ExplÉüers. Fun Facts. WÉüd Proèô. Parts oì Sp. Zoú Animal Roêks

/ / MET Day 000 NC1^ INRTL MNVR I E E PRE SLEEP K PRE SLEEP R E

Project Two RISC Processor Implementation ECE 485

Extinction Ratio and Power Penalty

3 2x. 3x 2. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

3. (2) What is the difference between fixed and hybrid instructions?

Multiple Short Term Infusion Homework # 5 PHA 5127

[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then

Histogram Processing

Anouncements. Conjugate Gradients. Steepest Descent. Outline. Steepest Descent. Steepest Descent

A s device signals an interrupt. time-> time T. A s device. starts device. starts device. A s ISR. WAIT/block. Process A. interrupt.

4. (3) What do we mean when we say something is an N-operand machine?

Goals for Performance Lecture

EEO 401 Digital Signal Processing Prof. Mark Fowler

Transcription:

MIPS Piplining Cpt280 D Cuti Nlon Intuction Excution C intuction: x = a + b; Ambly intuction: a a,b,x Stp 1: Stp 2: Stp 3: Stp : Stp 5: Stp 6: Ftch th intuction Dtmin it i an a intuction Ftch th ata a an b Do th aition Sto th ult in x Goto tp 1 Intuction Ftch Intuction Dco pan Ftch Excut Rult Sto Nxt Intuction Cpt280, Autumn 2017 1

Typical Ftch-Excut Achitctu Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Initializ PC to Point to Fit Intuction Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Cpt280, Autumn 2017 2

Rout Intuction to Intuction Rgit Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Slct Fom Rgit Fil Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Cpt280, Autumn 2017 3

Rout to Aithmtic Unit () Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Do th Computation Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Cpt280, Autumn 2017

Sto th Rult Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Incmnt th PC to Nxt Intuction Pogam Count (PC) Pogam Mmoy Intuction Rgit A Contol R In Mmoy (Rgit Fil) Cpt280, Autumn 2017 5

Piplining Piplining povi a mtho fo xcuting multipl intuction at th am tim. Exampl Ann, Bian, Cathy, Dav ach hav on loa of cloth to wah, y, an fol; Wah tak 30 minut; Dy tak 0 minut; Fol tak 20 minut. A B C D Squntial Launy 6 PM 7 8 9 10 11 Minight Tim T a k A B C D 30 0 20 30 0 20 30 0 20 30 0 20 Squntial launy tak 6 hou fo loa. Cpt280, Autumn 2017 6

Piplin Launy 6 PM 7 8 9 10 11 Minight Tim T a k A B C D 30 0 0 0 0 20 Piplin launy tak 3.5 hou fo loa. Piplining Lon T a k 6 PM 7 8 9 Tim 30 0 0 0 0 20 A B C D Piplining on t hlp latncy of ingl tak, it hlp thoughput of nti wokloa; Piplin at limit by lowt piplin tag; Piplining i multipl tak, opating imultanouly, uing iffnt ouc; Potntial pup = numb of pip tag; Unbalanc lngth of pip tag uc pup; Tim to fill piplin an tim to ain it uc pup; What low own th pip? Cpt280, Autumn 2017 7

Th Fiv Stag of th Loa Intuction Cycl 1 Cycl 2 Cycl 3 Cycl Cycl 5 Loa Iftch Rg/Dc Exc Mm W Iftch: Intuction ftch fom th intuction mmoy; Rg/Dc: Ftch ata fom git an co intuction; Exc: Calculat th mmoy a; Mm: Ra th ata fom ata mmoy; W: Wit th ata into th git fil. Piplin Excution Tim IFtch Dc Exc Mm WB IFtch Dc Exc Mm WB IFtch Dc Exc Mm WB IFtch Dc Exc Mm WB IFtch Dc Exc Mm WB Pogam Flow IFtch Dc Exc Mm WB Multipl intuction a in vaiou tag at th am tim. Aum: Each intuction tak fiv cycl. Cpt280, Autumn 2017 8

Gaphically Rpnting Piplin Tim (clock cycl) I n t. Int 0 Int 1 Sing th piplin can anw qution lik: How many cycl o it tak to xcut thi co? What i th oing uing cycl? A two intuction tying to u th am ouc at th am tim? Full Piplin Tim (clock cycl) I n t. Int 0 Int 1 Int 2 Int 3 Int Cpt280, Autumn 2017 9

Piplin Exampl CPI (Clock Cycl P Intuction) th mtic by which comput pfomanc i mau. Suppo: 100 intuction a xcut; Th ingl cycl machin (complt an intuction in on clock cycl) ha a cycl tim of 5 n; Th piplin machin ha a cycl tim of 10 n; Singl Cycl Machin 5 n/cycl x 1 CPI x 100 intuction = 500 n Ial Piplin Machin 10 n/cycl x (1 CPI x 100 intuction + cycl ain) = 100 n Ial piplin v. ingl cycl pup 500 n / 100 n =.33 Can Piplining gt u into Toubl? Y: Piplin Haza Stuctual haza - attmpt to u th am ouc two iffnt way at th am tim E.g., two intuction ty to a th am mmoy at th am tim. haza - attmpt to u an itm bfo it i ay Intuction pn on ult of pio intuction till in th piplin a 1, 2, 3 ub, 2, 1 Contol haza - attmpt to mak a ciion bfo conition i valuat Banch intuction a 1, 2, 3 bq 1, loop Can alway olv haza by waiting. Piplin contol mut tct an olv th haza. Cpt280, Autumn 2017 10

Singl Mmoy i a Stuctual Haza Tim (clock cycl) I n t. Loa Int 1 Int 2 Int 3 Int Mm Rg Mm Rg Mm Rg Mm Rg Mm Mm Rg Mm Rg Rg Mm Rg Mm Rg Mm Rg Stuctual Haza Limit Pfomanc Solution 1: U paat intuction an ata mmoi. Solution 2: Allow mmoy to a an wit mo than on wo p cycl. Solution 3: Stall. Cpt280, Autumn 2017 11

Haza Fo Rgit 1 Poblm: 1 cannot b a by oth intuction bfo it i wittn by th a intuction. a 1, 2, 3 ub, 1, 3 an 6, 1, 7 o 8, 1,9 xo 10, 1, 11 I n t. Haza on 1 Dpnnci backwa in tim a haza. Tim (clock cycl) IF ID/RF EX MEM WB a 1,2,3 ub,1,3 an 6,1,7 o 8,1,9 xo 10,1,11 Im Rg Dm Rg Cpt280, Autumn 2017 12

Haza Solution Th o i K if w fin a/wit poply. Fowa ult fom on tag to anoth. I n t. Tim (clock cycl) IF ID/RF EX MEM WB a 1,2,3 ub,1,3 an 6,1,7 o 8,1,9 xo 10,1,11 Im Rg Dm Rg Fowaing Loa Intuction Dpnnci backwa in tim a haza. Tim (clock cycl) IF ID/RF EX MEM WB lw 1,0(2) ub,1,3 Can t olv with fowaing - mut lay/tall intuction that a pnnt on loa. Cpt280, Autumn 2017 13

Contol Haza Solution 1 Stall, wait until ciion i cla. Solution 2 A mo hawa in 2 n tag to o th git compaion. I n t. A Bq Loa Tim (clock cycl) Mm Rg Mm Rg Mm Rg Mm Rg Mm Rg Mm Rg Contol Haza Solution Banch Piction Banch piction bit() Banch Hitoy Tabl I n t. A Bq Loa Tim (clock cycl) Mm Rg Mm Rg Mm Rg Mm Rg Mm Rg Mm Rg Cpt280, Autumn 2017 1

Summay Squntial xcution wa viw; Piplining wa intouc an illutat; Haza w not Stuctual; ; Contol. Solution to haza icu Stuctual mo hawa; - fowaing an bypaing; Contol banch piction. Cpt280, Autumn 2017 15