1.3 A Branch Delay Slot is (always advantageous / always disadvantageous / depends on compiler s ability to fill the slot) Explain
|
|
- Tamsin Ruth Norton
- 5 years ago
- Views:
Transcription
1
2 ee57_mt_sp2.fm Spring 2 EE57 Instructor: Gandhi Puvvada Midterm Exam (2%) Date: //2, Friday Time: :M - 2:2PM in THH2 Name: Total points: 28 Perfect score: 9 / 28 ( 23 points) 5 min. Pipelining I.F.R.F (Internally Forwarding Register File): I.F.R.F is (useful/useless but harmless/harmful) in a pipelined CPU. I.F.R.F is (useful/useless but harmless/harmful) in a multicycle CPU (st ed.). I.F.R.F is (useful/useless but harmless/harmful) in a multicycle CPU (2nd ed.). I.F.R.F is (useful/useless but harmless/harmful) in a single cycle CPU. If you marked harmful for any one, explain why it is harmful..2 If all the above four designs of the CPU (the single cycle CPU, the two multicycle CPUs, and the 5- stage pipelined CPU) are operated at the same (clock) frequency, best performance is provided by Explain..3 Branch Delay Slot is (always advantageous / always disadvantageous / depends on compiler s ability to fill the slot) Explain. If the original 5-stage CPU of first edition did not have a delay slot for the load-word instruction, it means, we (need / do not need) to have a Hazard Detection Unit (HDU) to stall an instruction in the delay slot, which is dependent on the load word. March 3, 2 : am EE57 Midterm Exam - Spring 2 Page - / 9 C Copyright 2 Gandhi Puvvada
3
4
5
6
7
8
9 ee57_mt_sp2.fm 2 ( = 8 points) 7 min. Pipelining (Modified Lab 7 part 3): In the Fall 2 midterm exam, we have an unit in each of the two EX stages, EX and EX2. Here, those two stages, EX and EX2, are merged into EX2. So DD8 needs an extra clock in EX2 as it has to go through the second also. Instruction Operation Opcode MSD 32-bit instruction in hex BZ DD8 D=Destination, S=Source NOP DS $R, $X; ($R) <= ($X) 8 8DS SUB3 $R, $X; ($R) <= ($X) - 3 DS BZ $X, JJJJ; (PC) <= JJJJ if ($X) = 2 JJJJDS $R, $X; ($R) <= ($X) + 2 2DS DD8 $R, $X; ($R) <= ($X) + 8 DS Further we introduced a BZ (Branch if Zero) instruction. It uses the opcode previously allocated to the SUB3 instruction. The instructions are 32-bits but the addresses are only 6-bit. PC is 6-bit wide and is incremented by a "". The JJJJ in the BZ $X, JJJJ stands for a 6-bit (-digit hex) absolute branch address. If the source register $X is a zero then branch to JJJJ takes place [ (PC) <= JJJJ if ($X) = ]. The "D" in "JJJJDS" is a random hex digit and should not be treated as a valid destination, similar to the "DS" in "DS" for a NOP instruction. BZ executes from the ID stage. You need to complete the early branch mechanism (dependency stalls, branch execution by causing PC to be changed to JJJJ and flushing the IF stage instruction, avoiding spurious branch execution during stalling, etc.) Complete the design on the page next to next (on page ). 2.2 In you lab 7 Part 3 Subpart 2 (EX and EX2 merged case), you used the left side circuit to stall for clock. Complete the design to show the STLL signal. Suppose you are given a flipflop with an asynchronous set as shown in the right side below (instead of the FF with an asynchronous clear as shown on the left). Redesign your stall circuit with this FF and show the STLL signal. DD D Q CLK CLK CLR CLK SET D Q CLK 2.3 When STLL_DD8 is active, you stall the entire pipeline. True / False When STLL_BR is active, you stall the entire pipeline. True / False IF_Flush mechanism here is (the same as / different from) the wrist-band mechanism used in our pipelined CPU design. March 3, 2 : am EE57 Midterm Exam - Spring 2 Page - 2 / 9 C Copyright 2 Gandhi Puvvada
10 ee57_mt_sp2.fm 2. In this design we have implemented an early branch. Would a medium branch from EX2 be better? Yes / No / It depends. Explain. Is it possible to postpone executing the BZ instruction all the way into the WB stage (WB!, not EX2)? Not Possible / possible but undesirable / possible and desirable. Explain 2.5 Combining EX and EX2 into one EX2 stage (as done here) is (always better / always worse / depends on the instruction sequence in the program). Explain. 2.6 How come, we carried (PC + ) to the ID stage in the text book design, but we do not carry (PC+) to the ID stage here? 2.7 Complete the following "Single Cycle CPU" kind of a design for the pipelined design on the next page. Complete the control unit also. PCSource Single Cycle CPU 6 6 PC_EN PC I-MEM Branch ddress JJJJ CU Reg. File RD R-Write RegWrite _ZERO + R_Mux SKIP + R2_Mux SKIP2 DD8 BZ complete this Branch pril, 2 2:9 pm EE57 Midterm Exam - Spring 2 Page - 3 / 9 C Copyright 2 Gandhi Puvvada
11 ee57_mt_sp2.fm 2. In this design we have implemented an early branch. Would a medium branch from EX2 be better? Yes / No / It depends. Explain. Is it possible to postpone executing the BZ instruction all the way into the WB stage (WB!, not EX2)? Not Possible / possible but undesirable / possible and desirable. Explain 2.5 Combining EX and EX2 into one EX2 stage (as done here) is (always better / always worse / depends on the instruction sequence in the program). Explain. 2.6 How come, we carried (PC + ) to the ID stage in the text book design, but we do not carry (PC+) to the ID stage here? 2.7 Complete the following "Single Cycle CPU" kind of a design for the pipelined design on the next page. Complete the control unit also. PCSource Single Cycle CPU 6 6 PC_EN PC I-MEM Branch ddress JJJJ CU Reg. File RD R-Write RegWrite _ZERO + R_Mux SKIP + R2_Mux SKIP2 DD8 BZ complete this Branch March 3, 2 : am EE57 Midterm Exam - Spring 2 Page - 3 / 9 C Copyright 2 Gandhi Puvvada
12 pril, 2 2:9 pm EE57 Midterm Exam - Spring 2 Page - / 9 PCSource 6 PC EN 6 + IF 6 6 I-MEM IF_Flush JJJJ BZ DD8 EN ID Comp Station in ID Stage ID_XMEX2 HDU_BR Branch ddress Reg. File ID_ ID_BZ ID_ ID_DD8 RD R-Write STLL_BR _ZERO XMEX2 DD8 EN EX2_XMEX2 X_Mux FORW FU + R_Mux SKIP EX2 + EX2_ EX2_ EX2_DD8 EX2_ WB EN R2_Mux WB_RD RD SKIP2 EX2_Write Write WB_Write WB_ ee57_mt_sp2.fm C Copyright 2 Gandhi Puvvada Comp Station in ID Stage ID_ Matched with EX2_ ID_XMEX2 P=Q P Q ID_ EX2_. Complete all missing connections to D Q CLK CLK CLR 2. Complete the STLL_DD8 logic in EX2 and STLL_BR logic in ID stage. 3. Complete all four enable (EN) controls on the pipeline registers (including PC).. Draw the logic to produce PCSource, IF_Flush, FORW, SKIP, SKIP2 on this page itsef. Modified LB 7 Part 3 Block Diagram STLL_DD8 Q#2
13 March 3, 2 : am EE57 Midterm Exam - Spring 2 Page - / 9 PCSource 6 PC EN 6 + IF 6 6 I-MEM IF_Flush JJJJ BZ DD8 EN ID Comp Station in ID Stage ID_XMEX2 HDU_BR Branch ddress Reg. File ID_ ID_BZ ID_ ID_DD8 RD R-Write STLL_BR _ZERO XMEX2 DD8 EN EX2_XMEX2 X_Mux FORW FU + R_Mux SKIP EX2 + EX2_ EX2_ EX2_DD8 EX2_ WB EN R2_Mux WB_RD RD SKIP2 EX2_Write Write WB_Write WB_ ee57_mt_sp2.fm C Copyright 2 Gandhi Puvvada Comp Station in ID Stage ID_ Matched with EX2_ ID_XMEX2 P=Q P Q ID_ EX2_. Complete all missing connections to D Q CLK CLK CLR 2. Complete the STLL_DD8 logic in EX2 and STLL_BR logic in ID stage. 3. Complete all four enable (EN) controls on the pipeline registers (including PC).. Draw the logic to produce PCSource, IF_Flush, FORW, SKIP, SKIP2 on this page itsef. Modified LB 7 Part 3 Block Diagram STLL_DD8 Q#2
14 ee57_mt_sp2.fm 2.8 Now let us try to build a multi-cycle version for the design on the previous page. It is proposed that, we go for a single LU, which can add a selected constant, ( for PC and for or DD8). DD8 uses the LU twice to add two times. This multi-cycle datapath is similar to the st edition design except that here the LU is built using dynamic logic (like in the 2nd edition). There is an LUOut register like in the 2nd edition. You need to carefully decide when to take (tap) data from the upstream of the LUOut register and when to take (tap) data from the downstream of the LUOut register. We have an IR register (Instruction Register) to hold the instruction at the end of the first state(s). IR is needed as PC is incremented using the LU in the very first state. We need to support a NOP instruction here besides,, DD8, and BZ Complete the datapath and the state diagram for control unit on the next two pages. To some extent, our state diagram resembles the 2nd edition state diagram reproduced below for your reference. We are doing a MOORE kind of state diagram and may be a wasting a few clocks. March 3, 2 : am EE57 Midterm Exam - Spring 2 Page - 5 / 9 C Copyright 2 Gandhi Puvvada
15 pril, 2 2:9 pm EE57 Midterm Exam - Spring 2 Page - 6 / 9 C Copyright 2 Gandhi Puvvada 6 PCSource PC_EN PC We (need / do not need) an LUOut_write control signal. I-MEM IRWrite 6 6 IR Branch ddress JJJJ DD8 BZ CU PCWrite PCWriteCond 6 lower 6 of the Strip 6 H R_Mux SKIP CU Concatenate Reg. File RD R-Write RegWrite Multi Cycle CPU 32 _ZERO PCWriteCond PCWrite PCSource ONE/FOUR Source[:] SKIP X_Mux Source[] C_Mux In_Mux Source[] ONE/FOUR LU B +B LUOut ee57_mt_sp2.fm
16 March 3, 2 : am EE57 Midterm Exam - Spring 2 Page - 6 / 9 C Copyright 2 Gandhi Puvvada 6 PCSource PC_EN PC We (need / do not need) an LUOut_write control signal. I-MEM IRWrite 6 6 IR Branch ddress JJJJ DD8 BZ CU PCWrite PCWriteCond 6 lower 6 of the Strip 6 H R_Mux SKIP Concatenate Reg. File RD R-Write RegWrite PCWriteCond PCWrite ONE/FOUR Source[:] SKIP Branch Multi Cycle CPU 32 _ZERO X_Mux Source[] C_Mux In_Mux Source[] ONE/FOUR LU B +B LUOut ee57_mt_sp2.fm
17 ee57_mt_sp2.fm NOP (= DD8 BZ) S S PCSource= Source[:]= ONE/FOUR = No RTL needed. No signal list. or DD8 BZ S2 S3 S6 DD8 S S Mr. Trojan says that, we can easily improve the above state machine by combining states S, S2, and S6 into one mealy state S26. Complete the S26 state on the side and also write the new state transition condition from S26 to S. To S S26 pril, 2 2:9 pm EE57 Midterm Exam - Spring 2 Page - 7 / 9 C Copyright 2 Gandhi Puvvada
18 ee57_mt_sp2.fm NOP (= DD8 BZ) S S PCSource= Source[:]= ONE/FOUR = No RTL needed. No signal list. or DD8 BZ S2 S3 S6 DD8 S S Mr. Trojan says that, we can easily improve the above state machine by combining states S, S2, and S6 into one mealy state S26. Complete the S26 state on the side and also write the new state transition condition from S26 to S. To S S26 March 3, 2 : am EE57 Midterm Exam - Spring 2 Page - 7 / 9 C Copyright 2 Gandhi Puvvada
1 ( 23 points) 15 min.
ee57_mt_sp2.fm Spring 2 EE57 Instructor: Gandhi Puvvada Midterm Exam (2%) Date: //2, Friday Time: :M - 2:2PM in THH2 Name: Total points: 28 Perfect score: 9 / 28 ( 23 points) 5 min. Pipelining 5 5 3. I.F.R.F
More information1 ( pipeline 89 + single cycle 20 + multicycle 44 = 153 points) 100 min.
ee57_mt_sp23.fm Spring 23 EE57 Instructor: Gandhi Puvvada Midterm Exam (2%) Date: /5/23, Friday Time: 9:5M - :5M in THH2 Name: Total points: 2 Perfect score: 22 / 2 ( pipeline 89 + single cycle 2 + multicycle
More information1 ( 42 points) 25 min.
Fall 2 EE457 Instructor: Gandhi Puvvada Final Exam (3%) Date: 2//2, Friday Closed Book, Closed Notes; Time: 8: - :45M SGM23 Calculator and Cadence Verilog Guide allowed Total points: 235 Name: Perfect
More informationDesign of a Simple Pipeline
EE457 Computer Systems Organization Lab #7 Part#3 Design of a Simple Pipeline Objective To design and implement a simple pipelined system (other than CPU). It is important to obtain a deep understanding
More informationDesign of a Simple Pipeline (RTL Coding)
EE457 Computer Systems Organization Lab #7 Part#3 Subparts #3 and #4 Objective Design of a Simple Pipeline (RTL Coding) To understand and appreciate the improved readability provided by RTL coding (Register
More informationee457_lab7_p3_simple_pipeline.fm 3/5/ 2 / Lab 7P3 C Copyright 2 Gandhi Puvvada PC EN RESET_B revised 7/8/2 Comp Station in ID Stage ID_XMEX P=Q IF ID EX EX2 WB I-MEM RESET_B Qualifying Signals XA MOV ADD
More informationEE457. Note: Parts of the solutions are extracted from the solutions manual accompanying the text book.
EE457 Instructor: G. Puvvada ======================================================================= Homework 5b, Solution ======================================================================= Note:
More informationCO Computer Architecture and Programming Languages CAPL. Lecture 18 & 19
CO2-3224 Computer Architecture and Programming Languages CAPL Lecture 8 & 9 Dr. Kinga Lipskoch Fall 27 Single Cycle Disadvantages & Advantages Uses the clock cycle inefficiently the clock cycle must be
More informationEE457 Lab 4 Part 4 Seven Questions From Previous Midterm Exams and Final Exams ee457_lab4_part4.fm 10/6/04
EE457 Lab 4 Part 4 Seven Questions From Previous Midterm Exams and Final Exams ee457_lab4_part4.fm 10/6/04 1 [Based on Question #7 of Summer 1993 Midterm] Remove TARGET register, add ZERO FF: Please refer
More informationCSE 2021 COMPUTER ORGANIZATION
CSE 2021 COMPUTER ORGANIZATION HUGH LAS CHESSER 1012U HUGH CHESSER CSEB 1012U W10-M Agenda Topics: 1. Multiple cycle implementation review 2. State Machine 3. Control Unit implementation for Multi-cycle
More informationRISC Design: Multi-Cycle Implementation
RISC Design: Multi-Cycle Implementation Virendra Singh Associate Professor Computer Architecture and Dependable Systems Lab Department of Electrical Engineering Indian Institute of Technology Bombay http://www.ee.iitb.ac.in/~viren/
More informationProcessor: Multi- Cycle Datapath & Control
Processor: Multi- Cycle Datapath & Control (Based on text: David A. Patterson & John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 3 rd Ed., Morgan Kaufmann, 27) COURSE
More informationECE 313 Computer Organization FINAL EXAM December 14, This exam is open book and open notes. You have 2 hours.
This exam is open book and open notes. You have 2 hours. Problems 1-4 refer to a proposed MIPS instruction lwu (load word - update) which implements update addressing an addressing mode that is used in
More informationCPE 335. Basic MIPS Architecture Part II
CPE 335 Computer Organization Basic MIPS Architecture Part II Dr. Iyad Jafar Adapted from Dr. Gheith Abandah slides http://www.abandah.com/gheith/courses/cpe335_s08/index.html CPE232 Basic MIPS Architecture
More informationTHE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY Computer Organization (COMP 2611) Spring Semester, 2014 Final Examination
THE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY Computer Organization (COMP 2611) Spring Semester, 2014 Final Examination May 23, 2014 Name: Email: Student ID: Lab Section Number: Instructions: 1. This
More informationMulti-cycle Approach. Single cycle CPU. Multi-cycle CPU. Requires state elements to hold intermediate values. one clock cycle or instruction
Multi-cycle Approach Single cycle CPU State element Combinational logic State element clock one clock cycle or instruction Multi-cycle CPU Requires state elements to hold intermediate values State Element
More informationRISC Processor Design
RISC Processor Design Single Cycle Implementation - MIPS Virendra Singh Indian Institute of Science Bangalore virendra@computer.org Lecture 13 SE-273: Processor Design Feb 07, 2011 SE-273@SERC 1 Courtesy:
More informationEXAM #1. CS 2410 Graduate Computer Architecture. Spring 2016, MW 11:00 AM 12:15 PM
EXAM #1 CS 2410 Graduate Computer Architecture Spring 2016, MW 11:00 AM 12:15 PM Directions: This exam is closed book. Put all materials under your desk, including cell phones, smart phones, smart watches,
More informationRISC Architecture: Multi-Cycle Implementation
RISC Architecture: Multi-Cycle Implementation Virendra Singh Associate Professor Computer Architecture and Dependable Systems Lab Department of Electrical Engineering Indian Institute of Technology Bombay
More informationEE 457 Midterm Summer 14 Redekopp Name: Closed Book / 105 minutes No CALCULATORS Score: / 100
EE 47 Midterm Summer 4 Redekopp Name: Closed Book / minutes No CALCULATORS Score: /. (7 pts.) Short Answer [Fill in the blanks or select the correct answer] a. If a control signal must be valid during
More informationPipelined Processor Design
Pipelined Processor Design Pipelined Implementation: MIPS Virendra Singh Indian Institute of Science Bangalore virendra@computer.org Lecture 20 SE-273: Processor Design Courtesy: Prof. Vishwani Agrawal
More informationMajor CPU Design Steps
Datapath Major CPU Design Steps. Analyze instruction set operations using independent RTN ISA => RTN => datapath requirements. This provides the the required datapath components and how they are connected
More informationRISC Architecture: Multi-Cycle Implementation
RISC Architecture: Multi-Cycle Implementation Virendra Singh Associate Professor Computer Architecture and Dependable Systems Lab Department of Electrical Engineering Indian Institute of Technology Bombay
More informationECE 313 Computer Organization FINAL EXAM December 14, This exam is open book and open notes. You have 2 hours.
This exam is open book and open notes. You have 2 hours. Problems 1-5 refer to the following: We wish to add a new R-Format instruction to the MIPS Instruction Set Architecture called l_inc (load and increment).
More informationData Hazards Compiler Scheduling Pipeline scheduling or instruction scheduling: Compiler generates code to eliminate hazard
Data Hazards Compiler Scheduling Pipeline scheduling or instruction scheduling: Compiler generates code to eliminate hazard Consider: a = b + c; d = e - f; Assume loads have a latency of one clock cycle:
More informationLecture 16: Pipeline Controls. Spring 2018 Jason Tang
Lecture 16: Pipeline Controls Spring 2018 Jason Tang 1 Topics Designing pipelined path Controlling pipeline operations 2 Pipelining Fetch Decode Execute Write ack Time Fetch Decode Execute Write ack Fetch
More informationEE 457 Midterm Summer 14 Redekopp Name: Closed Book / 105 minutes No CALCULATORS Score: / 100
EE 47 Midterm Summer 4 Redekopp Name: Closed Book / minutes No CALCULATORS Score: /. (7 pts.) Short Answer [Fill in the blanks or select the correct answer] a. If a control signal must be valid during
More information1 Hazards COMP2611 Fall 2015 Pipelined Processor
1 Hazards Dependences in Programs 2 Data dependence Example: lw $1, 200($2) add $3, $4, $1 add can t do ID (i.e., read register $1) until lw updates $1 Control dependence Example: bne $1, $2, target add
More informationee457_mt_sp2013.fm 3 ( 48 points) 30 min. Virtual Memory: 6 pts 9 pts 6 pts 6 pts 6 pts 7 pts 3.1 PTBR stands for. It is initiated by (hardware / oper
ee457_mt_sp2013.fm 3 ( 48 points) 30 min. Virtual Memory: 9 7 3.1 PTBR stands for. It is initiated by (hardware / operating system) and is utilized by (MMU / CCU) (i.e. memory management unit or cache
More informationEE557--FALL 1999 MAKE-UP MIDTERM 1. Closed books, closed notes
NAME: STUDENT NUMBER: EE557--FALL 1999 MAKE-UP MIDTERM 1 Closed books, closed notes Q1: /1 Q2: /1 Q3: /1 Q4: /1 Q5: /15 Q6: /1 TOTAL: /65 Grade: /25 1 QUESTION 1(Performance evaluation) 1 points We are
More information1 ( 10 points) 6 min.
ee201_midterm2_sp2010.fm Spring 2010 EE201L Instructor: Gandhi Puvvada Midterm Exam 2 (20%) Date: April 30, 2010, Friday Open-Book Open-Notes Exam Time: 4-6:20PM SGM101 Name: Notes and handouts in ring
More informationLecture 5 and 6. ICS 152 Computer Systems Architecture. Prof. Juan Luis Aragón
ICS 152 Computer Systems Architecture Prof. Juan Luis Aragón Lecture 5 and 6 Multicycle Implementation Introduction to Microprogramming Readings: Sections 5.4 and 5.5 1 Review of Last Lecture We have seen
More informationEE557--FALL 1999 MIDTERM 1. Closed books, closed notes
NAME: SOLUTIONS STUDENT NUMBER: EE557--FALL 1999 MIDTERM 1 Closed books, closed notes GRADING POLICY: The front page of your exam shows your total numerical score out of 75. The highest numerical score
More informationMultiple Cycle Data Path
Multiple Cycle Data Path CS 365 Lecture 7 Prof. Yih Huang CS365 1 Multicycle Approach Break up the instructions into steps, each step takes a cycle balance the amount of work to be done restrict each cycle
More informationCOMPUTER ORGANIZATION AND DESIGN
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle
More information14:332:331 Pipelined Datapath
14:332:331 Pipelined Datapath I n s t r. O r d e r Inst 0 Inst 1 Inst 2 Inst 3 Inst 4 Single Cycle Disadvantages & Advantages Uses the clock cycle inefficiently the clock cycle must be timed to accommodate
More informationVery short answer questions. You must use 10 or fewer words. "True" and "False" are considered very short answers.
Very short answer questions. You must use 10 or fewer words. "True" and "False" are considered very short answers. [1] Does peak performance track observed performance? [1] Predicting the direction of
More informationECE 313 Computer Organization FINAL EXAM December 13, 2000
This exam is open book and open notes. You have until 11:00AM. Credit for problems requiring calculation will be given only if you show your work. 1. Floating Point Representation / MIPS Assembly Language
More informationChapter 4 The Processor 1. Chapter 4B. The Processor
Chapter 4 The Processor 1 Chapter 4B The Processor Chapter 4 The Processor 2 Control Hazards Branch determines flow of control Fetching next instruction depends on branch outcome Pipeline can t always
More informationALUOut. Registers A. I + D Memory IR. combinatorial block. combinatorial block. combinatorial block MDR
Microprogramming Exceptions and interrupts 9 CMPE Fall 26 A. Di Blas Fall 26 CMPE CPU Multicycle From single-cycle to Multicycle CPU with sequential control: Finite State Machine Textbook Edition: 5.4,
More informationInstruction word R0 R1 R2 R3 R4 R5 R6 R8 R12 R31
4.16 Exercises 419 Exercise 4.11 In this exercise we examine in detail how an instruction is executed in a single-cycle datapath. Problems in this exercise refer to a clock cycle in which the processor
More informationPipelined Processor Design
Pipelined Processor Design Pipelined Implementation: MIPS Virendra Singh Computer Design and Test Lab. Indian Institute of Science (IISc) Bangalore virendra@computer.org Advance Computer Architecture http://www.serc.iisc.ernet.in/~viren/courses/aca/aca.htm
More informationMore CPU Pipelining Issues
More CPU Pipelining Issues What have you been beating your head against? This pipe stuff makes my head hurt! Important Stuff: Study Session for Problem Set 5 tomorrow night (11/11) 5:30-9:00pm Study Session
More informationTopic #6. Processor Design
Topic #6 Processor Design Major Goals! To present the single-cycle implementation and to develop the student's understanding of combinational and clocked sequential circuits and the relationship between
More informationFall 2016 Instructor: Gandhi Puvvada. Thursday, 9/22/2016 (A 2H 50M exam) 05:30 PM - 08:20 PM (170 min) in THH101. Student s Last Name:
EE457 Quiz (~0%) Closed-book Closed-notes Exam; No cheat sheets; No cell phones or computers Calculators and Verilog Guides are not needed and hence not allowed. Fall 206 Instructor: Gandhi Puvvada Thursday,
More informationEECE 417 Computer Systems Architecture
EECE 417 Computer Systems Architecture Department of Electrical and Computer Engineering Howard University Charles Kim Spring 2007 1 Computer Organization and Design (3 rd Ed) -The Hardware/Software Interface
More informationLECTURE 6. Multi-Cycle Datapath and Control
LECTURE 6 Multi-Cycle Datapath and Control SINGLE-CYCLE IMPLEMENTATION As we ve seen, single-cycle implementation, although easy to implement, could potentially be very inefficient. In single-cycle, we
More informationLearning Outcomes. Spiral 3-3. Sorting: Software Implementation REVIEW
3-3. Learning Outcomes 3-3. Spiral 3-3 Single Cycle CPU I understand how the single-cycle CPU datapath supports each type of instruction I understand why each mux is needed to select appropriate inputs
More informationID/EX EX-Stage. IF/ID ID-Stage. MEM-Stage WB-Stage. IF-Stage 3/26/2000. Hazard detection WB ME. unit ME (PC) Control. ALU_result. Shift Left 2 ALU Z
IF-Stage IF/ID ID/ -Stage /M M/ M-Stage -Stage Haza ID.Flush.Flush -8 funct shift rs opcode () r egisters funct shift rs () (rs) () Z () _result Ste_data Faing Memrite EG_data M_data 3/26/2 Pipelined CPU
More informationCS 251, Winter 2019, Assignment % of course mark
CS 251, Winter 2019, Assignment 5.1.1 3% of course mark Due Wednesday, March 27th, 5:30PM Lates accepted until 1:00pm March 28th with a 15% penalty 1. (10 points) The code sequence below executes on a
More informationCS 251, Winter 2018, Assignment % of course mark
CS 251, Winter 2018, Assignment 5.0.4 3% of course mark Due Wednesday, March 21st, 4:30PM Lates accepted until 10:00am March 22nd with a 15% penalty 1. (10 points) The code sequence below executes on a
More informationChapter 4. The Processor
Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS implementations A simplified
More informationECE369. Chapter 5 ECE369
Chapter 5 1 State Elements Unclocked vs. Clocked Clocks used in synchronous logic Clocks are needed in sequential logic to decide when an element that contains state should be updated. State element 1
More informationChapter 4. The Processor
Chapter 4 The Processor Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS implementations A simplified
More informationECE 313 Computer Organization FINAL EXAM December 11, Multicycle Processor Design 30 Points
This exam is open book and open notes. Credit for problems requiring calculation will be given only if you show your work. 1. Multicycle Processor Design 0 Points In our discussion of exceptions in the
More informationComputer Science 141 Computing Hardware
Computer Science 4 Computing Hardware Fall 6 Harvard University Instructor: Prof. David Brooks dbrooks@eecs.harvard.edu Upcoming topics Mon, Nov th MIPS Basic Architecture (Part ) Wed, Nov th Basic Computer
More informationCS422 Computer Architecture
CS422 Computer Architecture Spring 2004 Lecture 07, 08 Jan 2004 Bhaskaran Raman Department of CSE IIT Kanpur http://web.cse.iitk.ac.in/~cs422/index.html Recall: Data Hazards Have to be detected dynamically,
More informationMark Redekopp and Gandhi Puvvada, All rights reserved. EE 357 Unit 15. Single-Cycle CPU Datapath and Control
EE 37 Unit Single-Cycle CPU path and Control CPU Organization Scope We will build a CPU to implement our subset of the MIPS ISA Memory Reference Instructions: Load Word (LW) Store Word (SW) Arithmetic
More informationDepartment of Computer and IT Engineering University of Kurdistan. Computer Architecture Pipelining. By: Dr. Alireza Abdollahpouri
Department of Computer and IT Engineering University of Kurdistan Computer Architecture Pipelining By: Dr. Alireza Abdollahpouri Pipelined MIPS processor Any instruction set can be implemented in many
More informationSpring 2013 EE201L Instructor: Gandhi Puvvada. Time: 7:30-10:20AM SGM124 Total points: Perfect score: Open-Book Open-Notes Exam
Spring 2013 EE201L Instructor: Gandhi Puvvada Final Exam 2 (25%) Date: May 9, 2013, Thursday Name: Open-Book Open-Notes Exam Time: 7:30-10:20AM SGM124 Total points: Perfect score: 1 ( points) min. Memory
More informationComputer and Information Sciences College / Computer Science Department Enhancing Performance with Pipelining
Computer and Information Sciences College / Computer Science Department Enhancing Performance with Pipelining Single-Cycle Design Problems Assuming fixed-period clock every instruction datapath uses one
More informationPipelined CPUs. Study Chapter 4 of Text. Where are the registers?
Pipelined CPUs Where are the registers? Study Chapter 4 of Text Second Quiz on Friday. Covers lectures 8-14. Open book, open note, no computers or calculators. L17 Pipelined CPU I 1 Review of CPU Performance
More informationMikko Lipasti Spring 2002 ECE/CS 552 : Introduction to Computer Architecture IN-CLASS MIDTERM EXAM March 14th, 2002
ECE/CS 552 : Introduction to Computer Architecture IN-CLASS MIDTERM EXAM March 14th, 2002 NAME: This exam is to be done individually in 75 minutes. Total 10 Questions, 75 points 1. (10 Points) A sequence
More informationIntroduction to Pipelined Datapath
14:332:331 Computer Architecture and Assembly Language Week 12 Introduction to Pipelined Datapath [Adapted from Dave Patterson s UCB CS152 slides and Mary Jane Irwin s PSU CSE331 slides] 331 W12.1 Review:
More informationPoints available Your marks Total 100
CSSE 3 Computer Architecture I Rose-Hulman Institute of Technology Computer Science and Software Engineering Department Exam Name: Section: 3 This exam is closed book. You are allowed to use the reference
More informationLecture 7 Pipelining. Peng Liu.
Lecture 7 Pipelining Peng Liu liupeng@zju.edu.cn 1 Review: The Single Cycle Processor 2 Review: Given Datapath,RTL -> Control Instruction Inst Memory Adr Op Fun Rt
More informationWinter 2002 FINAL EXAMINATION
University of Calgary Department of Electrical and Computer Engineering ENCM 369: Computer Organization Instructors: Dr. S. A. Norman (L01) and Dr. S. Yanushkevich (L02) Note for Winter 2005 students Winter
More informationECE 313 Computer Organization EXAM 2 November 9, 2001
ECE 33 Computer Organization EA 2 November 9, 2 This exam is open book and open notes. You have 5 minutes. Credit for problems requiring calculation will be given only if you show your work. Choose and
More informationCSE 2021: Computer Organization Fall 2010 Solution to Assignment # 3: Multicycle Implementation
CSE 2021: Computer Organization Fall 2010 Solution to Assignment # 3: Multicycle Implementation Note that these questions are taken from the previous final exmas of CSE2021 and should serve as practice
More informationCSE 2021 COMPUTER ORGANIZATION
CSE 22 COMPUTER ORGANIZATION HUGH CHESSER CHESSER HUGH CSEB 2U 2U CSEB Agenda Topics:. Sample Exam/Quiz Q - Review 2. Multiple cycle implementation Patterson: Section 4.5 Reminder: Quiz #2 Next Wednesday
More informationMicroprogrammed Control Approach
Microprogrammed Control Approach Considering the FSM for our MIPS subset has 10 states, the complete MIPS instruction set, which contains more than 100 instructions, and considering that these instructions
More informationWinter 2006 FINAL EXAMINATION Auxiliary Gymnasium Tuesday, April 18 7:00pm to 10:00pm
University of Calgary Department of Electrical and Computer Engineering ENCM 369: Computer Organization Lecture Instructor for L01 and L02: Dr. S. A. Norman Winter 2006 FINAL EXAMINATION Auxiliary Gymnasium
More informationOPEN BOOK, OPEN NOTES. NO COMPUTERS, OR SOLVING PROBLEMS DIRECTLY USING CALCULATORS.
CS/ECE472 Midterm #2 Fall 2008 NAME: Student ID#: OPEN BOOK, OPEN NOTES. NO COMPUTERS, OR SOLVING PROBLEMS DIRECTLY USING CALCULATORS. Your signature is your promise that you have not cheated and will
More informationProcessor (multi-cycle)
CS359: Computer Architecture Processor (multi-cycle) Yanyan Shen Department of Computer Science and Engineering Five Instruction Steps ) Instruction Fetch ) Instruction Decode and Register Fetch 3) R-type
More informationLecture 9. Pipeline Hazards. Christos Kozyrakis Stanford University
Lecture 9 Pipeline Hazards Christos Kozyrakis Stanford University http://eeclass.stanford.edu/ee18b 1 Announcements PA-1 is due today Electronic submission Lab2 is due on Tuesday 2/13 th Quiz1 grades will
More informationCIS 662: Midterm. 16 cycles, 6 stalls
CIS 662: Midterm Name: Points: /100 First read all the questions carefully and note how many points each question carries and how difficult it is. You have 1 hour 15 minutes. Plan your time accordingly.
More informationCS433 Midterm. Prof Josep Torrellas. October 19, Time: 1 hour + 15 minutes
CS433 Midterm Prof Josep Torrellas October 19, 2017 Time: 1 hour + 15 minutes Name: Instructions: 1. This is a closed-book, closed-notes examination. 2. The Exam has 4 Questions. Please budget your time.
More informationMulticycle conclusion
Multicycle conclusion The last few lectures covered a lot of material! We introduced a multicycle datapath, where different instructions take different numbers of cycles to execute. A multicycle unit is
More informationCOMPUTER ORGANIZATION AND DESIGN
COMPUTER ORGANIZATION AND DESIGN 5 Edition th The Hardware/Software Interface Chapter 4 The Processor 4.1 Introduction Introduction CPU performance factors Instruction count CPI and Cycle time Determined
More informationDesign of a Pipelined CPU
EE457 Computer Systems Organization Lab #6 Part #, Part #2, Part #3, Part #4, and Part #5 Objective Design of a Pipelined CPU To investigate a Pipelined CPU which executes three MIPS instruction types
More informationECE154A Introduction to Computer Architecture. Homework 4 solution
ECE154A Introduction to Computer Architecture Homework 4 solution 4.16.1 According to Figure 4.65 on the textbook, each register located between two pipeline stages keeps data shown below. Register IF/ID
More informationComputer Organization and Structure
Computer Organization and Structure 1. Assuming the following repeating pattern (e.g., in a loop) of branch outcomes: Branch outcomes a. T, T, NT, T b. T, T, T, NT, NT Homework #4 Due: 2014/12/9 a. What
More informationPipelining Analogy. Pipelined laundry: overlapping execution. Parallelism improves performance. Four loads: Non-stop: Speedup = 8/3.5 = 2.3.
Pipelining Analogy Pipelined laundry: overlapping execution Parallelism improves performance Four loads: Speedup = 8/3.5 = 2.3 Non-stop: Speedup =2n/05n+15 2n/0.5n 1.5 4 = number of stages 4.5 An Overview
More informationInstr. execution impl. view
Pipelining Sangyeun Cho Computer Science Department Instr. execution impl. view Single (long) cycle implementation Multi-cycle implementation Pipelined implementation Processing an instruction Fetch instruction
More informationENE 334 Microprocessors
ENE 334 Microprocessors Lecture 6: Datapath and Control : Dejwoot KHAWPARISUTH Adapted from Computer Organization and Design, 3 th & 4 th Edition, Patterson & Hennessy, 2005/2008, Elsevier (MK) http://webstaff.kmutt.ac.th/~dejwoot.kha/
More informationCS252 Graduate Computer Architecture
CS252 Graduate Computer Architecture University of California Dept. of Electrical Engineering and Computer Sciences David E. Culler Spring 2005 Last name: Solutions First name I certify that my answers
More informationNote- E~ S. \3 \S U\e. ~ ~s ~. 4. \\ o~ (fw' \i<.t. (~e., 3\0)
5.4 A Multicycle Implementation 377 Similarly, if we had a machine with more powerful operations and addressing modes, instructions could vary from three or four functional unit delays to tens or even
More informationLECTURE 3: THE PROCESSOR
LECTURE 3: THE PROCESSOR Abridged version of Patterson & Hennessy (2013):Ch.4 Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU
More informationCS 61C: Great Ideas in Computer Architecture Pipelining and Hazards
CS 61C: Great Ideas in Computer Architecture Pipelining and Hazards Instructors: Vladimir Stojanovic and Nicholas Weaver http://inst.eecs.berkeley.edu/~cs61c/sp16 1 Pipelined Execution Representation Time
More information4. (2 pts) What is the only valid and unimpeachable measure of performance?
1. (2 pts) What concept is at the heart of RISC processing? 2. (2 pts) What are the two main ways to define performance? 3. (3 pts) What is Amdahl s law, inwords? 4. (2 pts) What is the only valid and
More informationCS 110 Computer Architecture. Pipelining. Guest Lecture: Shu Yin. School of Information Science and Technology SIST
CS 110 Computer Architecture Pipelining Guest Lecture: Shu Yin http://shtech.org/courses/ca/ School of Information Science and Technology SIST ShanghaiTech University Slides based on UC Berkley's CS61C
More informationﻪﺘﻓﺮﺸﻴﭘ ﺮﺗﻮﻴﭙﻣﺎﻛ يرﺎﻤﻌﻣ MIPS يرﺎﻤﻌﻣ data path and ontrol control
معماري كامپيوتر پيشرفته معماري MIPS data path and control abbasi@basu.ac.ir Topics Building a datapath support a subset of the MIPS-I instruction-set A single cycle processor datapath all instruction actions
More informationLecture 3: The Processor (Chapter 4 of textbook) Chapter 4.1
Lecture 3: The Processor (Chapter 4 of textbook) Chapter 4.1 Introduction Chapter 4.1 Chapter 4.2 Review: MIPS (RISC) Design Principles Simplicity favors regularity fixed size instructions small number
More informationCS232 Final Exam May 5, 2001
CS232 Final Exam May 5, 2 Name: This exam has 4 pages, including this cover. There are six questions, worth a total of 5 points. You have 3 hours. Budget your time! Write clearly and show your work. State
More informationCOMPUTER ORGANIZATION AND DESIGN. 5 th Edition. The Hardware/Software Interface. Chapter 4. The Processor
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition The Processor - Introduction
More informationChapter 4. Instruction Execution. Introduction. CPU Overview. Multiplexers. Chapter 4 The Processor 1. The Processor.
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface 5 th Edition Chapter 4 The Processor The Processor - Introduction
More informationL19 Pipelined CPU I 1. Where are the registers? Study Chapter 6 of Text. Pipelined CPUs. Comp 411 Fall /07/07
Pipelined CPUs Where are the registers? Study Chapter 6 of Text L19 Pipelined CPU I 1 Review of CPU Performance MIPS = Millions of Instructions/Second MIPS = Freq CPI Freq = Clock Frequency, MHz CPI =
More informationThe Processor (3) Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University
The Processor (3) Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu EEE3050: Theory on Computer Architectures, Spring 2017, Jinkyu Jeong (jinkyu@skku.edu)
More informationCS 152, Spring 2011 Section 2
CS 152, Spring 2011 Section 2 Christopher Celio University of California, Berkeley About Me Christopher Celio celio @ eecs Office Hours: Tuesday 1-2pm, 751 Soda Agenda Q&A on HW1, Lab 1 Pipelining Questions
More informationInf2C - Computer Systems Lecture 12 Processor Design Multi-Cycle
Inf2C - Computer Systems Lecture 12 Processor Design Multi-Cycle Boris Grot School of Informatics University of Edinburgh Previous lecture: single-cycle processor Inf2C Computer Systems - 2017-2018. Boris
More information