Datorteknik Pipeline1 bild 1 No Assembly line. Datorteknik Pipeline1 bild 2 Assembly line - start up 1.2.3.4.5. ChassisAxelsMotorSeatsBody Start up waste.

Slides:

Advertisements

Similar presentations

Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.

Advertisements

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 DelayedBranch bild 1 Delayed Branch All problems solved? NO, what will happen if b loop add $4 $6 $1... loop sub.

1 ECE369 ECE369 Pipelining. 2 ECE369 “toupper” :converts any lowercase characters (with ASCII codes between 97 and 122) in the null-terminated argument.

Morgan Kaufmann Publishers The Processor

Final Project : Pipelined Microprocessor Joseph Kim.

Datorteknik DataHazard bild 1 Data Hazards 0x30 sub $6 $0 $1 0x34 add $7 $6 $

1 Lecture: Out-of-order Processors Topics: out-of-order implementations with issue queue, register renaming, and reorder buffer, timing, LSQ.

Datorteknik F1 bild 1 Instruction Level Parallelism Scalar-processors –the model so far SuperScalar –multiple execution units in parallel VLIW –multiple.

Datorteknik ArithmeticCircuits bild 1 Computer arithmetic Somet things you should know about digital arithmetic: Principles Architecture Design.

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 IntegerMulDiv bild 1 MIPS mul/div instructions Multiply: mult $2,$3Hi, Lo = $2 x $3;64-bit signed product Multiply unsigned: multu$2,$3Hi,

Datorteknik Pipelining bild 1 Acceleration How to improve speed? At what costs?

Datorteknik DigitalCircuits bild 1 Combinational circuits Changes at inputs propagate at logic speed to outputs Not clocked No internal state (memoryless)

Pipelining Hwanmo Sung CS147 Presentation Professor Sin-Min Lee.

Lecture: Pipelining Basics

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.

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.

Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Pipeline Hazards See: P&H Chapter 4.7.

Chapter 6. (1)Long cycle time (2)Idle transistors.

1 Lecture 17: Basic Pipelining Today’s topics:  5-stage pipeline  Hazards and instruction scheduling Mid-term exam stats:  Highest: 90, Mean: 58.

ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )

1 Recap (Pipelining). 2 What is Pipelining? A way of speeding up execution of tasks Key idea : overlap execution of multiple taks.

1 Chapter Six - 2nd Half Pipelined Processor Forwarding, Hazards, Branching EE3055 Web:

EECE476: Computer Architecture Lecture 19: Pipelining Reducing Control Hazard Penalty Chapter 6.6 The University of British ColumbiaEECE 476© 2005 Guy.

Computer ArchitectureFall 2007 © October 22nd, 2007 Majd F. Sakr CS-447– Computer Architecture.

Computer ArchitectureFall 2007 © October 31, CS-447– Computer Architecture M,W 10-11:20am Lecture 17 Review.

Lecture: Pipelining Basics

Computer ArchitectureFall 2008 © October 6th, 2008 Majd F. Sakr CS-447– Computer Architecture.

Datorteknik PerformanceAnalyse bild 1 Performance –what is it: measures of performance The CPU Performance Equation: –Execution time as the measure –what.

Lecture 24: CPU Design Today’s topic –Multi-Cycle ALU –Introduction to Pipelining 1.

INSTRUCTION PIPELINE. Introduction An instruction pipeline is a technique used in the design of computers and other digital electronic devices to increase.

Lecture 05: Pipelining Basics & Hazards Kai Bu

55:035 Computer Architecture and Organization Lecture 10.

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.

Ch6a- 2 EE/CS/CPE Computer Organization  Seattle Pacific University Automobile Manufacturing 1. Build frame. 60 min. 2. Add engine. 50 min. 3.

Comp Sci pipelining 1 Ch. 13 Pipelining. Comp Sci pipelining 2 Pipelining.

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.

1 COMP541 Pipelined MIPS Montek Singh Mar 30, 2010.

CECS 440 Pipelining.1(c) 2014 – R. W. Allison [slides adapted from D. Patterson slides with additional credits to M.J. Irwin]

1 COMP541 Pipelined MIPS Montek Singh Apr 9, 2012.

Branch Prediction CS 3220 Fall 2014 Hadi Esmaeilzadeh Georgia Institute of Technology Some slides adopted from Prof. Milos Prvulovic.

Datapath and Control AddressInstruction Memory Write Data Reg Addr Register File ALU Data Memory Address Write Data Read Data PC Read Data Read Data.

Pipelining: Implementation CPSC 252 Computer Organization Ellen Walker, Hiram College.

Pipelining 7/12/2013.

Speed up on cycle time Stalls – Optimizing compilers for pipelining

Lecture 18: Pipelining I.

CDA3101 Recitation Section 8

Performance Performance The CPU Performance Equation:

ECE/CS 552: Pipelining © Prof. Mikko Lipasti

Lecture: Pipelining Basics

Performance of Single-cycle Design

CSCI206 - Computer Organization & Programming

Lecture: Pipelining Basics

CSCI206 - Computer Organization & Programming

ELEC / Computer Architecture and Design Spring Pipelining (Chapter 6)

Guerilla Section #4 10/05 SDS & MIPS Datapath

Lecture 5: Pipelining Basics

Pipelining Basic concept of assembly line

The Processor Lecture 3.6: Control Hazards

Pipeline Principle A non-pipelined system of combination circuits (A, B, C) that computation requires total of 300 picoseconds. Comb. logic.

Pipelining: critical path, pipeline hazards Prof. Eric Rotenberg

Delayed Load What will happen if lw $6 $0($1) add $4 $6 $1

Assembly line - start up

Pipelining Basic concept of assembly line

Pipelining Appendix A and Chapter 3.

Acceleration How to improve speed? At what costs?.

Introduction to Computer Organization and Architecture

A relevant question Assuming you’ve got: One washer (takes 30 minutes)

Lecture: Pipelining Basics

Presentation transcript:

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 = = = =