Exercise 4.6 Problems in this exercise assume that logic blocks needed to implement a processor’s datapath have the following latencies: 4.6.1 [10] <4.3>

Slides:



Advertisements
Similar presentations
Machine cycle.
Advertisements

1 COMP 4300 Computer Architecture Datapath Dr. Xiao Qin Auburn University Fall, 2010.
Superscalar processors Review. Dependence graph S1S2 Nodes: instructions Edges: ordered relations among the instructions Any ordering-based transformation.
MIPS processor continued. Review Different parts in the processor should be connected appropriately to be able to carry out the functions. Connections.
Pipeline Computer Organization II 1 Hazards Situations that prevent starting the next instruction in the next cycle Structural hazards – A required resource.
CIS 314 Fall 2005 MIPS Datapath (Single Cycle and Multi-Cycle)
CMPT 334 Computer Organization
Datorteknik DatapathControl bild 1 Designing a Single Cycle Datapath & Datapath Control.
CSCE 212 Quiz 8 – 3/23/11 1.What type of element is the ALU (combinational or state) and what does it mean for an element to be that type? 2.What is the.
Part 4 - Exception Hazards – one last kicker 3/24/04 Similar problem as the conditional branch An exception is an involuntary branch from a non-branching.
Fall 2007 MIPS Datapath (Single Cycle and Multi-Cycle)
Computer ArchitectureFall 2007 © October 3rd, 2007 Majd F. Sakr CS-447– Computer Architecture.
Computer Structure - Datapath and Control Goal: Design a Datapath  We will design the datapath of a processor that includes a subset of the MIPS instruction.
Computer ArchitectureFall 2007 © October 31, CS-447– Computer Architecture M,W 10-11:20am Lecture 17 Review.
S. Barua – CPSC 440 CHAPTER 5 THE PROCESSOR: DATAPATH AND CONTROL Goals – Understand how the various.
The Multicycle Processor CPSC 321 Andreas Klappenecker.
The Processor Andreas Klappenecker CPSC321 Computer Architecture.
Introduction to computer: executes instructions. Overview Topics discussed in this webnote: –Structure and operation of the CPU –Program flow –Types of.
Gary MarsdenSlide 1University of Cape Town Chapter 5 - The Processor  Machine Performance factors –Instruction Count, Clock cycle time, Clock cycles per.
W.S Computer System Design Lecture 4 Wannarat Suntiamorntut.
1. Building A CPU  We’ve built a small ALU l Add, Subtract, SLT, And, Or l Could figure out Multiply and Divide  What about the rest l How do.
MIPS processor continued. In Class Exercise Question Show the datapath of a processor that supports only R-type and jr reg instructions.
COMP541 Multicycle MIPS Montek Singh Mar 25, 2010.
By Wannarat Computer System Design Lecture 4 Wannarat Suntiamorntut.
1 CS/COE0447 Computer Organization & Assembly Language Chapter 5 Part 2.
MIPS processor continued. Performance Assume that – Memory access: 200ps – ALU and adders: 100 ps – Register file read: 50ps – Register file write: 10ps.
MIPS Processor.
MIPS processor continued. Review Different parts in the processor should be connected appropriately to be able to carry out the functions. Connections.
Exercise 4.2 The basic single-cycle MIPS implementation in Figure 4.2 can only implement some instructions. New instructions can be added to an existing.
Exercise 4.1 Different instructions utilize different hardware blocks in the basic single-cycle implementation. The next three problems in this exercise.
Exam-like questions.
Design of Digital Circuits Lecture 14: Microprogramming
Processor Architecture: Introduction to RISC Datapath (MIPS and Nios II) CSCE 230.
Morgan Kaufmann Publishers The Processor
Pipeline Implementation (4.6)
MIPS Processor.
MIPS processor continued
COSC 2021: Computer Organization Instructor: Dr. Amir Asif
MIPS processor continued
SOLUTIONS CHAPTER 4.
Figure 8.1 Architecture of a Simple Computer System.
CS/COE0447 Computer Organization & Assembly Language
CSCI206 - Computer Organization & Programming
CSCE 212 Chapter 5 The Processor: Datapath and Control
CS/COE0447 Computer Organization & Assembly Language
CS/COE0447 Computer Organization & Assembly Language
Computer Architecture
A Multiple Clock Cycle Instruction Implementation
MIPS Processor.
Figure 8.1 Architecture of a Simple Computer System.
MIPS processor continued
Computer System Design Lecture 5
The Processor Lecture 3.1: Introduction & Logic Design Conventions
Multicycle Approach We will be reusing functional units
Datapath: Instruction Store/Fetch & PC Increment
Fundamental Concepts Processor fetches one instruction at a time and perform the operation specified. Instructions are fetched from successive memory locations.
Systems Architecture I
MIPS Microarchitecture Multicycle Processor
COSC 2021: Computer Organization Instructor: Dr. Amir Asif
Pipelining: Basic Concepts
Computer System Design Lecture 5
Data Path Diagrams.
MIPS processor continued
MIPS assembly.
CS/COE0447 Computer Organization & Assembly Language
The Processor: Datapath & Control.
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,
MIPS Processor.
MIPS instructions.
CS/COE0447 Computer Organization & Assembly Language
Presentation transcript:

Exercise 4.6 Problems in this exercise assume that logic blocks needed to implement a processor’s datapath have the following latencies: 4.6.1 [10] <4.3> If the only thing we need to do in a processor is fetch consecutive instructions (Figure 4.6), what would the cycle time be? 4.6.2 [10] <4.3> Consider a datapath similar to the one in Figure 4.11, but for a processor that only has one type of instruction: unconditional PC-relative branch. What would the cycle time be for this datapath? 4.6.3 [10] <4.3> Repeat 4.6.2, but this time we need to support only conditional PC-relative branches.

Exercise 4.6 (Cont.) The remaining three problems in this exercise refer to the following logic block (resource) in the datapath: 4.6.4 [10] <4.3> Which kinds of instructions require this resource? 4.6.5 [20] <4.3> For which kinds of instructions (if any) is this resource on the critical path? 4.6.6 [10] <4.3> Assuming that we only support BEQ and ADD instructions, discuss how changes in the given latency of this resource affect the cycle time of the processor. Assume that the latencies of other resources do not change.