CS 251, Winter 2018, Assignment % of course mark

Similar documents
CS 251, Spring 2018, Assignment 3.0 3% of course mark

CS 251, Winter 2019, Assignment % of course mark

CS 251, Winter 2018, Assignment % of course mark

PART I: Adding Instructions to the Datapath. (2 nd Edition):

EEC 483 Computer Organization

The single-cycle design from last time

Quiz #1 EEC 483, Spring 2019

Review. A single-cycle MIPS processor

The final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.

The extra single-cycle adders

1048: Computer Organization

Review Multicycle: What is Happening. Controlling The Multicycle Design

Hardware Design Tips. Outline

Computer Architecture Chapter 5. Fall 2005 Department of Computer Science Kent State University

Prof. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:

EXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION

Review: Computer Organization

The multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM

EEC 483 Computer Organization

Chapter 6: Pipelining

Lab 8 (All Sections) Prelab: ALU and ALU Control

EXAMINATIONS 2003 END-YEAR COMP 203. Computer Organisation

Comp 303 Computer Architecture A Pipelined Datapath Control. Lecture 13

Solutions for Chapter 6 Exercises

Review. How to represent real numbers

Winter 2013 MIDTERM TEST #2 Wednesday, March 20 7:00pm to 8:15pm. Please do not write your U of C ID number on this cover page.

Computer Architecture

Computer Architecture

Instruction fetch. MemRead. IRWrite ALUSrcB = 01. ALUOp = 00. PCWrite. PCSource = 00. ALUSrcB = 00. R-type completion

PS Midterm 2. Pipelining

Lecture 7. Building A Simple Processor

ECE232: Hardware Organization and Design

TDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction

Pipelining. Chapter 4

Overview of Pipelining

Exceptions and interrupts

Chapter 3 & Appendix C Pipelining Part A: Basic and Intermediate Concepts

What do we have so far? Multi-Cycle Datapath

Enhanced Performance with Pipelining

Chapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind

Lecture 9: Microcontrolled Multi-Cycle Implementations

comp 180 Lecture 25 Outline of Lecture The ALU Control Operation & Design The Datapath Control Operation & Design HKUST 1 Computer Science

Review: Abstract Implementation View

EEC 483 Computer Organization. Branch (Control) Hazards

1048: Computer Organization

1048: Computer Organization

CSE Introduction to Computer Architecture Chapter 5 The Processor: Datapath & Control

Lecture 6: Microprogrammed Multi Cycle Implementation. James C. Hoe Department of ECE Carnegie Mellon University

CSEN 601: Computer System Architecture Summer 2014

Computer and Information Sciences College / Computer Science Department The Processor: Datapath and Control

ECE473 Computer Architecture and Organization. Processor: Combined Datapath

CPE 335 Computer Organization. Basic MIPS Architecture Part I

CENG 3420 Lecture 06: Datapath

Computer Architecture. Lecture 6: Pipelining

CSSE232 Computer Architecture I. Mul5cycle Datapath

POWER-OF-2 BOUNDARIES

Chapter 6: Pipelining

Mark Redekopp and Gandhi Puvvada, All rights reserved. EE 357 Unit 15. Single-Cycle CPU Datapath and Control

Animating the Datapath. Animating the Datapath: R-type Instruction. Animating the Datapath: Load Instruction. MIPS Datapath I: Single-Cycle

Adding Support for jal to Single Cycle Datapath (For More Practice Exercise 5.20)

Computer Architecture Lecture 6: Multi-cycle Microarchitectures. Prof. Onur Mutlu Carnegie Mellon University Spring 2012, 2/6/2012

CENG 3420 Computer Organization and Design. Lecture 06: MIPS Processor - I. Bei Yu

ECE 313 Computer Organization EXAM 2 November 9, 2001

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET

ELEC 5200/6200 Computer Architecture and Design Spring 2017 Lecture 4: Datapath and Control

The Processor. Z. Jerry Shi Department of Computer Science and Engineering University of Connecticut. CSE3666: Introduction to Computer Architecture

MIPS Architecture. Fibonacci (C) Fibonacci (Assembly) Another Example: MIPS. Example: subset of MIPS processor architecture

Lecture 10: Pipelined Implementations

ECE 313 Computer Organization Name SOLUTION EXAM 2 November 3, Floating Point 20 Points

4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1

Processor (I) - datapath & control. Hwansoo Han

CSE 2021 Computer Organization. Hugh Chesser, CSEB 1012U W9-W

Processor Design CSCE Instructor: Saraju P. Mohanty, Ph. D. NOTE: The figures, text etc included in slides are borrowed

CS359: Computer Architecture. The Processor (A) Yanyan Shen Department of Computer Science and Engineering

EEM 486: Computer Architecture. Lecture 3. Designing Single Cycle Control

MIPS-Lite Single-Cycle Control

CSE140: Components and Design Techniques for Digital Systems

Chapter 5: The Processor: Datapath and Control

How to design a controller to produce signals to control the datapath

Chapter 4. The Processor. Computer Architecture and IC Design Lab

ECE232: Hardware Organization and Design

Ch 5: Designing a Single Cycle Datapath

CSE 378 Midterm 2/12/10 Sample Solution

PIPELINING. Pipelining: Natural Phenomenon. Pipelining. Pipelining Lessons

ECE 313 Computer Organization FINAL EXAM December 14, This exam is open book and open notes. You have 2 hours.

Computer Architecture

The Processor: Datapath & Control

ECS 154B Computer Architecture II Spring 2009

Functions of Combinational Logic

The overall datapath for RT, lw,sw beq instrucution

Lecture 3: The Processor (Chapter 4 of textbook) Chapter 4.1

Inf2C - Computer Systems Lecture Processor Design Single Cycle

COMPUTER ORGANIZATION AND DESIGN. 5 th Edition. The Hardware/Software Interface. Chapter 4. The Processor

Instruction Pipelining is the use of pipelining to allow more than one instruction to be in some stage of execution at the same time.

SI232 Set #20: Laundry, Co-dependency, and other Hazards of Modern (Architecture) Life. Chapter 6 ADMIN. Reading for Chapter 6: 6.1,

COMP303 Computer Architecture Lecture 9. Single Cycle Control

are Softw Instruction Set Architecture Microarchitecture are rdw

Multiple Cycle Data Path

Pipelined Datapath. Reading. Sections Practice Problems: 1, 3, 8, 12 (2) Lecture notes from MKP, H. H. Lee and S.

CS152 Computer Architecture and Engineering Lecture 10: Designing a Single Cycle Control. Recap: The MIPS Instruction Formats

Transcription:

CS 25, Winter 28, Assignment 3.. 3% of corse mark De onday, Febrary 26th, 4:3 P Lates accepted ntil : A, Febrary 27th with a 5% penalty. IEEE 754 Floating Point ( points): (a) (4 points) Complete the following table, showing the sign & magnitde and the corresponding biased representations with a bias of 27. Sign & agnitde 99 2 Biased (b) (6 points) the base 2 nmber. as a 32-bit, IEEE normalized floating point nmber with biased eponent. 3 3 29 28 27 26 25 24 23 22 2 2 9 8 7 6 488 5 4 3 2 9 8 7 6 5 4 3 2

2. (5 points) Consider the single-cycle compter shown on page 6 of this assignment. Sppose the circit elements take the following times: Instr mem: 2ps, Register read: 3ps, Register write: 3ps, and all adders: 5ps, Data : 2ps, Control Unit: ps, Shift Left Units: 5 Assme that PC and UXes don t take any time. Compte the minimm eection time for each instrction type below: R-format: LW: SW: Branch: Jmp: 3. (8 points) Consider the assembly langage instrction at address 256: 256: add $3,$6,$4 In the figre on the net page, there are eight darks lines. On each line, write in the vale that travels along the corresponding wire(s) when eecting this assembly langage instrction. Note: yo shold write a decimal nmber on each dark line, and not an epression involving things like PC, etc. (Some nmbers are more natral to write in binary; for any binary nmbers yo se, yo shold sbscript them with a 2 like 2.) Assme that each register $i (with i > ) contains the decimal vale 4 + i. Frther assme that the shamt field of this R-format instrction is. 2

(Qestion 2, contined) PC Add 4 address Instrction Instrction [3 ] Instrction [3 26] Instrction [25 2] Instrction [2 6] Instrction [5 ] Instrction [5 ] Control RegDst Branch em emtoreg Op em Src Reg register register 2 register Registers 2 6 32 Sign etend Instrction [5 ] Shift left 2 control Add reslt Zero reslt Address Data PCSrc 3

4. (5 pts) Consider the following IPS assembly langage instrctions: addi $, $2, : swr $, ($2): addi $rt, $rs, immediate # add immediate swr $rt, immediate($rs) # store word write register These instrctions are I-format instrctions similar to the load word and store word instrctions. The addi and swr instrctions store a compted vale to the destination register $rt. The instrctions do not reqire any physical hardware changes to the path. The effect of each instrction is given below. Fill in the table below indicating the vale of all eisting control lines necessary to eecte the addi and swr instrctions on the path. Yo mst se don t cares where appropriate. The swr instrction stores to and writes to the register file. It stores to at address [$rs+$rt] the vale contained in $rt. Also, it takes the sm of the $rs and $rt registers and writes the reslt to register $rt. The new vale of $rt is pdated at the end of the clock cycle. addi: $rt <= se immediate + $rs swr: E[$rs+$rt] <= $rt, $rt <= $rs + $rt Type Reg em Reg em em Branch Dst Src ToReg op op R-format lw sw X X beq X X addi swr 4

5. ( pts) We want to modify the single-cycle compter to implement a new instrction in the path. The mimm or immediate instrction is an I-format instrction. The form of this IPS instrction is mimm rt, offset(rs) This instrction comptes the sm of the signed etended offset and rs, and stores this at the address stored in rt. em[rt] <= se offset + rs (a) (6 pts) odify the Single Cycle path on the net page in order to implement the mimm instrction. Yo may add mltipleors, control bits and additional components as needed. arks will also be awarded for the efficiency of the soltion. Be sre that all other IPS instrctions eecting on the path will still work. Smmarize yor changes to the path below, and make the modifications to the path provided on the net page. (b) (4 pts) In the table below, give the settings of the control bits to implement the new mimm IPS instrction. Use Don t Cares where appropriate. If yo need an etra control line to implement this instrction or if yo need to increase the nmber of bits in a control line, add additional colmns to the table for the new control line, split a colmn to increase the nmber of bits in a control line, and in either case inclde a note below eplaining the effect of the new/increased control line(s) on the path and what its setting shold be for other instrctions. ake sre yo do not break any other instrctions. Yo shold be able to determine the prpose and effects of each of the control signals from the Single Cycle path on the net page. Type Reg em Reg em em Branch Dst Src ToReg op op mimm State the vale(s) of any new control signal(s) for other IPS instrctions: 5

PC Add 4 address Instrction Instrction [3 ] Instrction [25 ] Shift Jmp address [3 ] left 2 26 28 PC+4 [3 28] Instrction [3 26] Control RegDst Jmp Branch em emtoreg Op em Src Reg Instrction [25 2] Instrction [2 6] Instrction [5 ] register register 2 register Registers 2 Instrction [5 ] 6 32 Sign etend Instrction [5 ] Shift left 2 control Add reslt Zero reslt Address Data 6

Additional eercises on single-cycle architectre: The rest of the corse will focs on improvements to the single-cycle architectre. Before proceeding, yo may wish to do some additional eercises from the tetbook (nmarked, soltions not provided): Eercise 3.2 Eercise 4. Eercise 4.2 Eercise 4.3 7