We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byMontana Slaymaker
Modified about 1 year ago
Datorteknik Pipeline1 bild 1 No Assembly line
Datorteknik Pipeline1 bild 2 Assembly line - start up ChassisAxelsMotorSeatsBody Start up waste t
Datorteknik Pipeline1 bild 3 Assembly line - stop ChassisAxelsMotorSeatsBody Nothing to do
Datorteknik Pipeline1 bild 4 Assembly line At start: final stations idle At stop: start stations idle 5 “stages” for each car Each car still takes 5 stages but we produce one car each step
Datorteknik Pipeline1 bild 5 Assembly line Time-set car Cycles instruction = 5 5 cycles 1 instr. = 1 5 cycles 5 instr. Without pipelining: With pipelining
Datorteknik Pipeline1 bild 6 Pipelining T = Nq * CPI * Tc We can bring thisBut what down to 1 determines this? The slowest pipeline stage “Rate determining step”
Datorteknik Pipeline1 bild 7 Pipeline is most efficient......when the work is equally shared “critical path” delay same for each stage or as close as possible
Datorteknik Pipeline1 bild 8 How do we break up a long critical path? Insert flip - flops!
Datorteknik Pipeline1 bild 9 But - “no free lunch” Delay: 30 ns 10 ns Latency:1 cycle3 cycles Also: The flip-flops have a cost! 30 ns 10 ns
Datorteknik Pipeline1 bild 10 Pipeline problem: Start-up waste Unexpected problem in a stage (stall) No more orders (flush)
Datorteknik Pipeline1 bild 11 Branch logic Sgn/Ze extend Zero ext. ALU A B = = = =
Datorteknik Pipelining bild 1 Acceleration How to improve speed? At what costs?
Datorteknik DelayedLoad bild 1 Delayed Load. Datorteknik DelayedLoad bild 2 All problems solved? NO, what will happen if lw $6 $0($1) add $4 $6.
Datorteknik DelayedBranch bild 1 Delayed Branch All problems solved? NO, what will happen if b loop add $4 $6 $1... loop sub.
Datorteknik DataHazard bild 1 Data Hazards 0x30 sub $6 $0 $1 0x34 add $7 $6 $
Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.
Datorteknik PerformanceAnalyse bild 1 Performance –what is it: measures of performance The CPU Performance Equation: –Execution time as the measure –what.
1 Lecture: Pipelining Basics Topics: Basic pipelining implementation Video 1: What is pipelining? Video 2: Clocks and latches Video 3: An example.
1 ECE369 ECE369 Pipelining. 2 ECE369 “toupper” :converts any lowercase characters (with ASCII codes between 97 and 122) in the null-terminated argument.
1 Lecture 17: Basic Pipelining Today’s topics: 5-stage pipeline Hazards and instruction scheduling Mid-term exam stats: Highest: 90, Mean: 58.
55:035 Computer Architecture and Organization Lecture 10.
Lecture 24: CPU Design Today’s topic –Multi-Cycle ALU –Introduction to Pipelining 1.
Ch6a- 2 EE/CS/CPE Computer Organization Seattle Pacific University Automobile Manufacturing 1. Build frame. 60 min. 2. Add engine. 50 min. 3.
1 A few words about the quiz Closed book, but you may bring in a page of handwritten notes. –You need to know what the “core” MIPS instructions do. –I.
1 COMP541 Pipelined MIPS Montek Singh Apr 9, 2012.
Datorteknik ArithmeticCircuits bild 1 Computer arithmetic Somet things you should know about digital arithmetic: Principles Architecture Design.
Chapter 4 The Processor CprE 381 Computer Organization and Assembly Level Programming, Fall 2013 Zhao Zhang Iowa State University Revised from original.
Datorteknik DigitalCircuits bild 1 Combinational circuits Changes at inputs propagate at logic speed to outputs Not clocked No internal state (memoryless)
1 Lecture: Pipelining Basics Topics: Performance equations wrap-up, Basic pipelining implementation Video 1: What is pipelining? Video 2: Clocks and.
1 COMP541 Pipelined MIPS Montek Singh Mar 30, 2010.
Automobile Manufacturing 1. Build frame. 60 min. 2. Add engine. 50 min. 3. Build body. 80 min. 4. Paint. 40 min. 5. Finish.45 min. 275 min. Latency: Time.
Datorteknik IntegerMulDiv bild 1 MIPS mul/div instructions Multiply: mult $2,$3Hi, Lo = $2 x $3;64-bit signed product Multiply unsigned: multu$2,$3Hi,
1 Designing a Pipelined Processor In this Chapter, we will study 1. Pipelined datapath 2. Pipelined control 3. Data Hazards 4. Forwarding 5. Branch Hazards.
The Light at the End of the Tunnel – Doesn’t Mean You Died ! Part 3 - Branch Hazards – Easier! – 3/24/04 This is a control hazard – as opposed to data.
Pipelining Hwanmo Sung CS147 Presentation Professor Sin-Min Lee.
INSTRUCTION PIPELINE. Introduction An instruction pipeline is a technique used in the design of computers and other digital electronic devices to increase.
Computer ArchitectureFall 2007 © October 31, CS-447– Computer Architecture M,W 10-11:20am Lecture 17 Review.
Final Project : Pipelined Microprocessor Joseph Kim.
Comp Sci pipelining 1 Ch. 13 Pipelining. Comp Sci pipelining 2 Pipelining.
1 Lecture: Out-of-order Processors Topics: out-of-order implementations with issue queue, register renaming, and reorder buffer, timing, LSQ.
Pipelining: Implementation CPSC 252 Computer Organization Ellen Walker, Hiram College.
CECS 440 Pipelining.1(c) 2014 – R. W. Allison [slides adapted from D. Patterson slides with additional credits to M.J. Irwin]
Datapath and Control AddressInstruction Memory Write Data Reg Addr Register File ALU Data Memory Address Write Data Read Data PC Read Data Read Data.
EECE476: Computer Architecture Lecture 19: Pipelining Reducing Control Hazard Penalty Chapter 6.6 The University of British ColumbiaEECE 476© 2005 Guy.
Computer ArchitectureFall 2008 © October 6th, 2008 Majd F. Sakr CS-447– Computer Architecture.
1 Lecture 16: Basic Pipelining Today’s topics: 1-stage design 5-stage design 5-stage pipeline Hazards Mid-term exam stats:
How Computers Work Lecture 12 Page 1 How Computers Work Lecture 12 Introduction to Pipelining.
1 Lecture 3: Pipelining Basics Biggest contributors to performance: clock speed, parallelism Today: basic pipelining implementation (Sections A.1-A.3)
1 Recap (Pipelining). 2 What is Pipelining? A way of speeding up execution of tasks Key idea : overlap execution of multiple taks.
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )www.cse.psu.edu/~mji
11 Pipelining Kosarev Nikolay MIPT Oct, Pipelining Implementation technique whereby multiple instructions are overlapped in execution Each pipeline.
1 Lecture: Pipelining Hazards Topics: Basic pipelining implementation, hazards, bypassing HW2 posted, due Wednesday.
Computer ArchitectureFall 2007 © October 22nd, 2007 Majd F. Sakr CS-447– Computer Architecture.
1 Chapter Six - 2nd Half Pipelined Processor Forwarding, Hazards, Branching EE3055 Web:
1 Performance of Single-cycle Design CPU time X,P = Instructions executed P * CPI X,P * Clock cycle time X At the start of the cycle, PC is updated (PC.
Chapter 4 From: Dr. Iyad F. Jafar Basic MIPS Architecture: Single-Cycle Datapath and Control.
Chapter 4 Sections 4.1 – 4.4 Appendix D.1 and D.2 Dr. Iyad F. Jafar Basic MIPS Architecture: Single-Cycle Datapath and Control.
Datorteknik F1 bild 1 Instruction Level Parallelism Scalar-processors –the model so far SuperScalar –multiple execution units in parallel VLIW –multiple.
Lecture 15: Pipelined Datapath Soon Tee Teoh CS 147.
© 2017 SlidePlayer.com Inc. All rights reserved.