Topic 6: Pipelining and Pipelined Architecture

Slides:



Advertisements
Similar presentations
Instruction Level Parallelism and Superscalar Processors
Advertisements

Machine cycle.
CMPE 421 Advanced Parallel Computer Architecture Pipeline datapath and Control.
PipelineCSCE430/830 Pipeline: Introduction CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Prof. Yifeng Zhu, U of Maine Fall,
Lecture 4: CPU Performance
PIPELINING AND VECTOR PROCESSING
Computer Organization and Architecture
CSCI 4717/5717 Computer Architecture
1 ITCS 3181 Logic and Computer Systems B. Wilkinson Slides9.ppt Modification date: March 30, 2015 Processor Design.
Lecture Objectives: 1)Define pipelining 2)Calculate the speedup achieved by pipelining for a given number of instructions. 3)Define how pipelining improves.
CMPT 334 Computer Organization
Computer ArchitectureFall 2007 © October 31, CS-447– Computer Architecture M,W 10-11:20am Lecture 17 Review.
Appendix A Pipelining: Basic and Intermediate Concepts
Pipelining Basics Assembly line concept An instruction is executed in multiple steps Multiple instructions overlap in execution A step in a pipeline is.
Chapter 2 Summary Classification of architectures Features that are relatively independent of instruction sets “Different” Processors –DSP and media processors.
Pipelining (I). Pipelining Example  Laundry Example  Four students have one load of clothes each to wash, dry, fold, and put away  Washer takes 30.
CSE 340 Computer Architecture Summer 2014 Basic MIPS Pipelining Review.
EKT303/4 Superscalar vs Super-pipelined.
Oct. 18, 2000Machine Organization1 Machine Organization (CS 570) Lecture 4: Pipelining * Jeremy R. Johnson Wed. Oct. 18, 2000 *This lecture was derived.
3/12/2013Computer Engg, IIT(BHU)1 CONCEPTS-1. Pipelining Pipelining is used to increase the speed of processing It uses temporal parallelism In pipelining,
11 Pipelining Kosarev Nikolay MIPT Oct, Pipelining Implementation technique whereby multiple instructions are overlapped in execution Each pipeline.
Introduction to Computer Organization Pipelining.
RISC / CISC Architecture by Derek Ng. Overview CISC Architecture RISC Architecture  Pipelining RISC vs CISC.
Chapter One Introduction to Pipelined Processors.
Advanced Computer Architecture CS 704 Advanced Computer Architecture Lecture 10 Computer Hardware Design (Pipeline Datapath and Control Design) Prof. Dr.
Computer Architecture Lecture 7: Microprogrammed Microarchitectures Prof. Onur Mutlu Carnegie Mellon University Spring 2013, 1/30/2013.
Lecture 18: Pipelining I.
Computer Organization
Pipelines An overview of pipelining
Pipelining Chapter 6.
William Stallings Computer Organization and Architecture 8th Edition
William Stallings Computer Organization and Architecture 8th Edition
Performance of Single-cycle Design
CMSC 611: Advanced Computer Architecture
Pipelining.
Chapter 14 Instruction Level Parallelism and Superscalar Processors
Single Clock Datapath With Control
Chapter One Introduction to Pipelined Processors
CDA 3101 Spring 2016 Introduction to Computer Organization
\course\cpeg323-08F\Topic6b-323
Design of the Control Unit for Single-Cycle Instruction Execution
Pipelining.
Chapter 4 The Processor Part 2
Single-cycle datapath, slightly rearranged
Pipelining Chapter 6.
Topic 6: Pipelining and Pipelined Architecture
Instruction Level Parallelism and Superscalar Processors
Pipelined Datapath The MIPS Example 2018/11/29
Serial versus Pipelined Execution
A Multiple Clock Cycle Instruction Implementation
Systems Architecture II
\course\cpeg323-05F\Topic6b-323
Topic 5: Processor Architecture Implementation Methodology
Pipelining Chapter 6.
Single Cycle vs. Multiple Cycle
An Introduction to pipelining
Pipeline Principle A non-pipelined system of combination circuits (A, B, C) that computation requires total of 300 picoseconds. Comb. logic.
Topic 5: Processor Architecture
Designing a Pipelined CPU
Pipelining: Basic Concepts
Pipelining.
Part IV Data Path and Control
Created by Vivi Sahfitri
Pipelining Appendix A and Chapter 3.
Morgan Kaufmann Publishers The Processor
Introduction to Computer Organization and Architecture
This module covers the following topics.
Guest Lecturer: Justin Hsia
Pipelining.
Presentation transcript:

Topic 6: Pipelining and Pipelined Architecture 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

Reading List Slides: Topic6x Henn & Patt: Chapter 6 Other papers as assigned in class or homeworks 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

Pipelining What is pipelining - basic concepts Pipelined datapath: A case study of MIPS Pipeline control Pipeline hazard resolution 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

Pipelining – the basic concepts 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

Basic Concept Pipeline: multiple instructions are simultaneously in execution Pipeline is divided into “segments” or “stages” Machine cycle: Time required to move through one stage Machine cycle is determined by the slowest stage in the pipe Often Machine Clock cycle cycle = 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

In a perfectly balanced pipelined machine instruction time = In a normal machine (1) is not true, i.e. - stage time does not equal there is overhead but it can be very close to 10% within (1) non-pipe time # of pipe stages (1) 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

Pipelining as an Architecture Technique Generally may be invisible to user Scalar pipelined machine vs. vector machine 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

# of instructions cycle completed Pipeline throughout So pipeline increases throughout, but the time for execution of each instruction remains unchanged. Clock rate of a pipelined machine is limited by: latch time clock skew the delay time required for clock signals to propagate on a chip. # of instructions completed cycle 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

Performance Limitations of a Pipeline Rate cannot exceed the slowest stage Complexities in reality - different processing time for different stages - interaction/dependencies between stages - may be data dependent (dynamic) 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

The most important factors on “pipe beat” (cycle time) STAGE 1 LACHES Combinational Logic STAGE 2 LACHES STAGE 3 LACHES STAGE n LACHES (b) The most important factors on “pipe beat” (cycle time) latch delay and clock skew 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

Overlap vs. Pipeline Pipeline: tightly coupled subfunctions fixed basic stage time independent basic function evaluation Overlap Loosely coupled subfunctions variable basic stage time dependency between function evaluation 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

CPU/I/O Overlapping Common memory Computational processor (stage 1) Input/output processor (stage 2) 1 Task 1 Task 2 Task 1 Task 3 . . . 2 Task 2 Task 1 Task 3 Task 1 Time =Idle time CPU/I/O Overlapping 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

MIPS Pipeline Pipeline stages: IF ID (decode + Reg fetch) EX MEM Write back On each clock cycle another instruction is fetched and begins its five-step execution. If an instruction is started every clock cycle, the performance will be five times that of a machine that is not pipelined. 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt

MIPS Pipeline - Another Representation 2019/1/18 \course\cpeg323-08F\Topic6-323.ppt