RISC Architecture: Multi-Cycle Implementation
|
|
- Terence Newton
- 6 years ago
- Views:
Transcription
1 RISC Architecture: Multi-Cycle Implementation Virendra Singh Associate Professor Computer Architecture and Dependable Systems Lab Department of Electrical Engineering Indian Institute of Technology Bombay Computer Organization & Architecture Lecture 13 (16 April 2013)
2 Example Processor MIPS subset MIPS Instruc,on Subset v Arithme,c and Logical Instruc,ons Ø add, sub, or, and, slt v Memory reference Instruc,ons Ø lw, sw v Branch Ø beq, j 16 Apr 2013 Computer Architecture@IIT Mandi 2
3 Instruction Format v simple instruc,ons, all 32 bits wide v very structured, no unnecessary baggage v only three instruc,on formats R I J op rs1 rs2 rd shmt op rs1 rd 16 bit address/data op 26 bit address funct v rely on compiler to achieve performance 16 Apr 2013 Computer Architecture@IIT Mandi 3
4 How Fast Can the Clock Be? If every instruc,on is executed in one clock cycle, then: Clock period must be at least 8ns to perform the longest instruc,on, i.e., lw. This is a single cycle machine. It is slower because many instruc,ons take less than 8ns but are s,ll allowed that much,me. Method of speeding up: Use mul,cycle datapath. 16 Apr 2013 Computer Architecture@IIT Mandi 4
5 Multicycle Datapath PC Addr. Data Memory Instr. reg. (IR) Mem. Data (MDR) Register file A Reg. B Reg. 4 ALU ALUOut Reg. One-cycle data transfer paths (need registers to hold data) 16 Apr 2013 Computer Architecture@IIT Mandi 5
6 Multicycle Datapath Requirements Only one ALU, since it can be reused. Single memory for instruc,ons and data. Five registers added: Instruc,on register (IR) Memory data register (MDR) Three ALU registers, A and B for inputs and ALUOut for output 16 Apr 2013 Computer Architecture@IIT Mandi 6
7 Multicycle Datapath PCSource IorD out MUX in1 PCWrite etc. PC in2 control Data Addr. Memory to Control FSM Instr. reg. (IR) IRWrite Mem. Data (MDR) Register file RegDst RegWrite B Reg. A Reg. ALUSrcA ALUSrcB Shift left ALU ALUOut Reg. MemRead MemWrite MemtoReg Sign extend Shift left 2 ALU control ALUOp 16 Apr 2013 Computer Architecture@IIT Mandi 7
8 3 to 5 Cycles for an Instruction Step R-type Mem. Ref. Branch type J-type (4 cycles) (4 or 5 cycles) (3 cycles) (3 cycles) Instruc9on fetch IR Memory[PC]; PC PC+4 Instr. decode/ Reg. fetch Execu9on, addr. Comp., branch & jump comple9on ALUOut A op B A Reg(IR[21-25]); B Reg(IR[16-20]) ALUOut PC + (sign extend IR[0-15]) << 2 ALUOut A+sign extend (IR[0-15]) If (A= =B) then PC ALUOut PC PC[28-3 1] (IR[0-25]<<2) Mem. Access or R- type comple9on Memory read comple9on Reg(IR[11-1 5]) ALUOut MDR M[ALUout] or M[ALUOut] B Reg(IR[16-20]) MDR 16 Apr 2013 Computer Architecture@IIT Mandi 8
9 Cycle 1 of 5: Instruction Fetch (IF) Read instruc,on into IR, M[PC] IR Control signals used:» IorD = 0 select PC» MemRead = 1 read memory» IRWrite = 1 write IR Increment PC, PC + 4 PC Control signals used:» ALUSrcA = 0 select PC into ALU» ALUSrcB = 01 select constant 4» ALUOp = 00 ALU adds» PCSource = 00 select ALU output» PCWrite = 1 write PC 16 Apr 2013 Computer Architecture@IIT Mandi 9
10 Cycle 2 of 5: Instruction Decode (ID) R I J opcode reg 1 reg 2 reg 3 shamt fncode opcode reg 1 reg 2 word address increment opcode word address jump Control unit decodes instruc,on Datapath prepares for execu,on R and I types, reg 1 A reg, reg 2 B reg» No control signals needed Branch type, compute branch address in ALUOut» ALUSrcA = 0 select PC into ALU» ALUSrcB = 11 Instr. Bits 0-15 shif 2 into ALU» ALUOp = 00 ALU adds 16 Apr 2013 Computer Architecture@IIT Mandi 10
11 Cycle 3 of 5: Execute (EX) R type: execute func,on on reg A and reg B, result in ALUOut Control signals used:» ALUSrcA = 1 A reg into ALU» ALUsrcB = 00 B reg into ALU» ALUOp = 10 instr. Bits 0-5 control ALU I type, lw or sw: compute memory address in ALUOut A reg + sign extend IR[0-15] Control signals used:» ALUSrcA = 1 A reg into ALU» ALUSrcB = 10 Instr. Bits 0-15 into ALU» ALUOp = 00 ALU adds 16 Apr 2013 Computer Architecture@IIT Mandi 11
12 Cycle 3 of 5: Execute (EX) I type, beq: subtract reg A and reg B, write ALUOut to PC Control signals used:» ALUSrcA = 1 A reg into ALU» ALUsrcB = 00 B reg into ALU» ALUOp = 01 ALU subtracts» If zero = 1, PCSource = 01 ALUOut to PC» If zero = 1, PCwriteCond = 1 write PC» Instruc9on complete, go to IF J type: write jump address to PC IR[0-25] shif 2 and four leading bits of PC Control signals used:» PCSource = 10» PCWrite = 1 write PC» Instruc9on complete, go to IF 16 Apr 2013 Computer Architecture@IIT Mandi 12
13 Cycle 4 of 5: Reg Write/Memory R type, write des,na,on register from ALUOut Control signals used:» RegDst = 1 Instr. Bits specify reg.» MemtoReg = 0 ALUOut into reg.» RegWrite = 1 write register» Instruc9on complete, go to IF I type, lw: read M[ALUOut] into MDR Control signals used:» IorD = 1 select ALUOut into mem adr.» MemRead = 1 read memory to MDR I type, sw: write M[ALUOut] from B reg Control signals used:» IorD = 1 select ALUOut into mem adr.» MemWrite = 1 write memory» Instruc9on complete, go to IF 16 Apr 2013 Computer Architecture@IIT Mandi 13
14 Cycle 5 of 5: Reg Write I type, lw: write MDR to reg[ir(16-20)] Control signals used:» RegDst = 0 instr. Bits are write reg» MemtoReg = 1 MDR to reg file write input» RegWrite = 1 read memory to MDR» Instruc9on complete, go to IF For an alternative method of designing datapath, see N. Tredennick, Microprocessor Logic Design, the Flowchart Method, Digital Press, Apr 2013 Computer Architecture@IIT Mandi 14
15 1-bit Control Signals Signal name Value = 0 Value =1 RegDst Write reg. # = bit Write reg. # = bit RegWrite No action Write reg. Write data ALUSrcA First ALU Operand PC First ALU Operand Reg. A MemRead No action Mem.Data Output M[Addr.] MemWrite No action M[Addr.] Mem. Data Input MemtoReg Reg.File Write In ALUOut Reg.File Write In MDR IorD Mem. Addr. PC Mem. Addr. ALUOut IRWrite No action IR Mem.Data Output PCWrite No action PC is written PCWriteCond No action PC is written if zero(alu)=1 zero(alu) PCWriteCond PCWrite PCWrite etc. 16 Apr 2013 Computer Architecture@IIT Mandi 15
16 2-bit Control Signals Signal name Value Action ALUOp ALUSrcB PCSource 00 ALU performs add 01 ALU performs subtract 10 Funct. field (0-5 bits of IR ) determines ALU operation 00 Second input of ALU B reg. 01 Second input of ALU 4 (constant) 10 Second input of ALU 0-15 bits of IR sign ext. to 32b 11 Second input of ALU 0-15 bits of IR sign ext. and left shift 2 bits 00 ALU output (PC +4) sent to PC 01 ALUOut (branch target addr.) sent to PC 10 Jump address IR[0-25] shifted left 2 bits, concatenated with PC+4[28-31], sent to PC 16 Apr 2013 Computer Architecture@IIT Mandi 16
17 Control: Finite State Machine Start Clock cycle 1 Clock cycle 2 State 1 State 0 Instruction fetch Instruction decode and register fetch Clock cycles 3-5 FSM-M Memory access instr. FSM-R FSM-B FSM-J R-type instr. Branch instr. Jump instr. 16 Apr 2013 Computer Architecture@IIT Mandi 17
18 State 0: Instruction Fetch (CC1) PCSource=00 PC IorD=0 out MUX in1 PCWrite etc.=1 in2 control Data Addr. Memory to Control FSM Instr. reg. (IR) IRWrite = Mem. Data (MDR) Register file RegDst RegWrite B Reg. A Reg. ALUSrcA=0 Shift left ALUSrcB=01 4 ALU Add ALUOut Reg. MemRead = 1 MemWrite MemtoReg Sign extend Shift left 2 ALU control ALUOp =00 16 Apr 2013 Computer Architecture@IIT Mandi 18
19 State 0 Control FSM Outputs State0 Instruction fetch Start MemRead =1 ALUSrcA = 0 IorD = 0 IRWrite = 1 ALUSrcB = 01 ALUOp = 00 PCWrite = 1 PCSource = 00 State 1 Instruction decode/ Register fetch/ Branch addr. Outputs? 16 Apr 2013 Computer Architecture@IIT Mandi 19
20 State 1: Instr. Decode/Reg. Fetch/ Branch Address (CC2) PCSource IorD out MUX in1 PCWrite etc. PC in2 control Data Addr. Memory to Control FSM Instr. reg. (IR) IRWrite Mem. Data (MDR) Register file RegDst RegWrite B Reg. A Reg. ALUSrcA=0 Shift left ALUSrcB=11 4 ALU Add ALUOut Reg. MemRead MemWrite MemtoReg Sign extend Shift left 2 ALU control ALUOp = Apr 2013 Computer Architecture@IIT Mandi 20
21 State 1 Control FSM Outputs State0 Instruction fetch (IF) Start MemRead =1 ALUSrcA = 0 IorD = 0 IRWrite = 1 ALUSrcB = 01 ALUOp = 00 PCWrite = 1 PCSource = 00 State 1 Instruction decode (ID) / Register fetch / Branch addr. ALUSrcA = 0 ALUSrcB = 11 ALUOp = 00 Opcode = BEQ Opcode = J-type FSM-M FSM-R FSM-B FSM-J 16 Apr 2013 Computer Architecture@IIT Mandi 21
22 State 1 (Opcode = lw) FSM-M (CC3-5) CC4 PCSource MUX in1 PCWrite etc. PC IorD=1 out in2 control Addr. Data Memory to Control FSM Instr. reg. (IR) IRWrite Mem. Data (MDR) RegWrite=1 Register file CC5 RegDst=0 B Reg. A Reg. ALUSrcA=1 Shift left ALUSrcB=10 4 CC3 ALU Add ALUOut Reg. MemRead=1 MemWrite MemtoReg= Sign extend Shift left 2 ALU control ALUOp = Apr 2013 Computer Architecture@IIT Mandi 22
23 State 1 (Opcode= sw) FSM-M (CC3-4) CC4 PCSource PC IorD=1 out MUX in1 PCWrite etc. in2 control Addr. Data Memory to Control FSM CC4 Instr. reg. (IR) IRWrite Mem. Data (MDR) RegWrite Register file RegDst=0 B Reg. A Reg. ALUSrcA=1 Shift left ALUSrcB=10 4 CC3 ALU Add ALUOut Reg. MemRead MemWrite=1 MemtoReg Sign extend Shift left 2 ALU control ALUOp = Apr 2013 Computer Architecture@IIT Mandi 23
24 FSM-M (Memory Access) From state 1 Opcode = lw or sw Read Memory data Opcode = lw Compute mem addrress ALUSrcA =1 ALUSrcB = 10 ALUOp = 00 Opcode = sw Write memory MemRead = 1 IorD = 1 Write register MemWrite = 1 IorD = 1 RegWrite = 1 MemtoReg = 1 RegDst = 0 To state 0 (Instr. Fetch) 16 Apr 2013 Computer Architecture@IIT Mandi 24
25 State 1(Opcode=R-type) FSM-R (CC3-4) PCSource IorD out MUX in1 PCWrite etc. PC in2 control Addr. Data Memory to Control FSM Instr. reg. (IR) IRWrite Mem. Data (MDR) RegWrite Register file A Reg CC3 RegDst=0 CC4 B Reg. ALUSrcA=1 Shift left ALUSrcB=00 4 ALU ALUOut Reg. funct. code MemRead MemWrite MemtoReg=0 Sign extend Shift left 2 16 Apr 2013 Computer Architecture@IIT Mandi ALU control ALUOp = 10
26 FSM-R (R-type Instruction) From state 1 Opcode = R-type ALU operation ALUSrcA =1 ALUSrcB = 00 ALUOp = 10 Write register RegWrite = 1 MemtoReg = 0 RegDst = 1 To state 0 (Instr. Fetch) 16 Apr 2013 Computer Architecture@IIT Mandi 26
27 State 1 (Opcode = beq ) FSM-B (CC3) IorD out MUX in1 PCWrite etc.=1 PC in2 control Addr. Data Memory to Control FSM Instr. reg. (IR) IRWrite Mem. Data (MDR) Register file RegDst RegWrite A Reg. CC3 B Reg. If(zero) ALUSrcA=1 Shift left ALUSrcB=00 4 ALU zero ALUOut Reg. subtract PCSource 01 MemRead MemWrite MemtoReg Sign extend Shift left 2 16 Apr 2013 Computer Architecture@IIT Mandi ALU control ALUOp = 01
28 Write PC on zero zero=1 PCWriteCond=1 PCWrite PCWrite etc.=1 16 Apr 2013 Computer Mandi 28
29 FSM-B (Branch) From state 1 Opcode = beq Write PC on branch condition ALUSrcA =1 ALUSrcB = 00 ALUOp = 01 PCWriteCond=1 PCSource=01 Branch condition: If A B=0 zero = 1 To state 0 (Instr. Fetch) 16 Apr 2013 Computer Architecture@IIT Mandi 29
30 State 1 (Opcode = j) FSM-J (CC3) in1 PCWrite etc. PC IorD Dat out a MUX control in2 Addr. Memory MemRead MemWrite to Control FSM Instr. reg. (IR) IRWrite Mem. Data (MDR) MemtoReg Register file RegDst CC3 RegWrite Sign extend A Reg. B Reg. ALUSrcA ALUSrcB Shift left 2 Shift left ALU zero ALU control PCSource 10 ALUOut Reg. ALUOp 16 Apr 2013 Computer Architecture@IIT Mandi 30
31 Write PC zero PCWriteCond PCWrite=1 PCWrite etc.=1 16 Apr 2013 Computer Mandi 31
32 FSM-J (Jump) From state 1 Opcode = jump Write jump addr. In PC PCWrite=1 PCSource=10 To state 0 (Instr. Fetch) 16 Apr 2013 Computer Architecture@IIT Mandi 32
33 Control FSM 3 State 0 2 Instr. fetch/ adv. PC Start 1 Instr. decode/reg. fetch/branch addr. R B J Read memory data Write register lw 4 5 Compute memory addr. sw Write memory data 6 7 ALU operation Write register Write PC on branch condition 8 9 Write jump addr. to PC 16 Apr 2013 Computer Architecture@IIT Mandi 33
34 Control FSM (Controller) 6 inputs (opcode) Combinational logic 16 control outputs Present state Next state Reset Clock FF FF FF FF 16 Apr 2013 Computer Architecture@IIT Mandi 34
35 Designing the Control FSM Encode states; need 4 bits for 10 states, e.g., State 0 is 0000, state 1 is 0001, and so on. Write a truth table for combina,onal logic: Opcode Present state Control signals Next state Synthesize a logic circuit from the truth table. Connect four flip- flops between the next state outputs and present state inputs. 16 Apr 2013 Computer Architecture@IIT Mandi 35
36 Block Diagram of a Processor MemWrite MemRead Controller (Control FSM) ALUOp 2-bits ALU control Opcode 6-bits zero Overflow ALUSrcA ALUSrcB 2-bits PCSource 2-bits RegDst RegWrite MemtoReg IorD IRWrite PCWrite PCWriteCond funct. [0,5] ALUOp 3-bits Reset Clock Mem. Addr. Datapath (PC, register file, registers, ALU) Mem. write data Mem. data out 16 Apr 2013 Computer Architecture@IIT Mandi 36
37 Exceptions or Interrupts Condi,ons under which the processor may produce incorrect result or may hang. Illegal or undefined opcode. Arithme,c overflow, divide by zero, etc. Out of bounds memory address. EPC: 32- bit register holds the affected instruc,on address. Cause: 32- bit register holds an encoded excep,on type. For example, 0 for undefined instruc,on 1 for arithme,c overflow 16 Apr 2013 Computer Architecture@IIT Mandi 37
38 Implementing Exceptions PCWrite etc.=1 PC MUX out in1 in2 control to Control FSM Instr. reg. (IR) 0 1 CauseWrite=1 Cause 32-bit register (hex) ALUSrcA=0 ALUSrcB=01 4 ALU ALU control Subtract PCSource 11 EPCWrite=1 EPC Overflow to Control FSM ALUOp =01 16 Apr 2013 Computer Architecture@IIT Mandi 38
39 How Long Does It Take? Again Assume control logic is fast and does not affect the cri,cal,ming. Major,me components are ALU, memory read/write, and register read/write. Time for hardware opera,ons, suppose Memory read or write 2ns Register read 1ns ALU opera,on 2ns Register write 1ns 16 Apr 2013 Computer Mandi 39
40 Single-Cycle Datapath R- type 6ns Load word (I- type) 8ns Store word (I- type) 7ns Branch on equal (I- type) 5ns Jump (J- type) 2ns Clock cycle,me = 8ns Each instruc,on takes one cycle 16 Apr 2013 Computer Architecture@IIT Mandi 40
41 Multicycle Datapath Clock cycle,me is determined by the longest opera,on, ALU or memory: Clock cycle,me = 2ns Cycles per instruc,on (CPI): lw 5 (10ns) sw 4 (8ns) R- type 4 (8ns) beq 3 (6ns) j 3 (6ns) 16 Apr 2013 Computer Architecture@IIT Mandi 41
42 CPI of a Computer k (Instructions of type k) CPI k CPI = k (instructions of type k) where CPI k = Cycles for instruction of type k Note: CPI is dependent on the instruction mix of the program being run. Standard benchmark programs are used for specifying the performance of CPUs. 16 Apr 2013 Computer Architecture@IIT Mandi 42
43 Example Consider a program containing: loads 25% stores 10% branches 11% jumps 2% Arithme,c 52% CPI = = 4.12 for mul,cycle datapath CPI = 1.00 for single- cycle datapath 16 Apr 2013 Computer Architecture@IIT Mandi 43
44 Multicycle vs. Single-Cycle Performance ratio = Single cycle time / Multicycle time (CPI cycle time) for single-cycle = (CPI cycle time) for multicycle ns = = ns Single cycle is faster in this case, but remember, performance ratio depends on the instruction mix. 16 Apr 2013 Computer Architecture@IIT Mandi 44
45 Thank You 16 Apr 2013 Computer Mandi 45
RISC 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 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 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 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 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 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 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 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 informationSystems Architecture I
Systems Architecture I Topics A Simple Implementation of MIPS * A Multicycle Implementation of MIPS ** *This lecture was derived from material in the text (sec. 5.1-5.3). **This lecture was derived from
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 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 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 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 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 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 informationCC 311- Computer Architecture. The Processor - Control
CC 311- Computer Architecture The Processor - Control Control Unit Functions: Instruction code Control Unit Control Signals Select operations to be performed (ALU, read/write, etc.) Control data flow (multiplexor
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 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 informationChapter 5: The Processor: Datapath and Control
Chapter 5: The Processor: Datapath and Control Overview Logic Design Conventions Building a Datapath and Control Unit Different Implementations of MIPS instruction set A simple implementation of a processor
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 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 informationChapter 5 Solutions: For More Practice
Chapter 5 Solutions: For More Practice 1 Chapter 5 Solutions: For More Practice 5.4 Fetching, reading registers, and writing the destination register takes a total of 300ps for both floating point add/subtract
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 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 informationThe Processor: Datapath & Control
Chapter Five 1 The Processor: Datapath & Control We're ready to look at an implementation of the MIPS Simplified to contain only: memory-reference instructions: lw, sw arithmetic-logical instructions:
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 informationLets Build a Processor
Lets Build a Processor Almost ready to move into chapter 5 and start building a processor First, let s review Boolean Logic and build the ALU we ll need (Material from Appendix B) operation a 32 ALU result
More informationCOMPUTER ORGANIZATION AND DESIGN. The Hardware/Software Interface. Chapter 4. The Processor: A Based on P&H
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface Chapter 4 The Processor: A Based on P&H Introduction We will examine two MIPS implementations A simplified version A more realistic pipelined
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 informationMicroprogramming. Microprogramming
Microprogramming Alternative way of specifying control FSM State -- bubble control signals in bubble next state given by signals on arc not a great language to specify when things are complex Treat as
More informationControl Unit for Multiple Cycle Implementation
Control Unit for Multiple Cycle Implementation Control is more complex than in single cycle since: Need to define control signals for each step Need to know which step we are on Two methods for designing
More informationInitial Representation Finite State Diagram. Logic Representation Logic Equations
Control Implementation Alternatives Control may be designed using one of several initial representations. The choice of sequence control, and how logic is represented, can then be determined independently;
More informationProcessor (I) - datapath & control. Hwansoo Han
Processor (I) - datapath & control Hwansoo Han Introduction CPU performance factors Instruction count - Determined by ISA and compiler CPI and Cycle time - Determined by CPU hardware We will examine two
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 informationBeyond Pipelining. CP-226: Computer Architecture. Lecture 23 (19 April 2013) CADSL
Beyond Pipelining 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 informationCOMP303 - Computer Architecture Lecture 10. Multi-Cycle Design & Exceptions
COP33 - Computer Architecture Lecture ulti-cycle Design & Exceptions Single Cycle Datapath We designed a processor that requires one cycle per instruction RegDst busw 32 Clk RegWr Rd ux imm6 Rt 5 5 Rs
More informationSystems Architecture
Systems Architecture Lecture 15: A Simple Implementation of MIPS Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan Some or all figures from Computer Organization and Design: The Hardware/Software
More informationELEC 5200/6200 Computer Architecture and Design Spring 2017 Lecture 4: Datapath and Control
ELEC 52/62 Computer Architecture and Design Spring 217 Lecture 4: Datapath and Control Ujjwal Guin, Assistant Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL 36849
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 informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Data Paths and Microprogramming
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Data Paths and Microprogramming We have spent time looking at the MIPS instruction set architecture and building
More informationLecture 8: Control COS / ELE 375. Computer Architecture and Organization. Princeton University Fall Prof. David August
Lecture 8: Control COS / ELE 375 Computer Architecture and Organization Princeton University Fall 2015 Prof. David August 1 Datapath and Control Datapath The collection of state elements, computation elements,
More informationAlternative to single cycle. Drawbacks of single cycle implementation. Multiple cycle implementation. Instruction fetch
Drawbacks of single cycle implementation Alternative to single cycle All instructions take the same time although some instructions are longer than others; e.g. load is longer than add since it has to
More informationSingle vs. Multi-cycle Implementation
Single vs. Multi-cycle Implementation Multicycle: Instructions take several faster cycles For this simple version, the multi-cycle implementation could be as much as 1.27 times faster (for a typical instruction
More informationCS/COE0447: Computer Organization
CS/COE0447: Computer Organization and Assembly Language Datapath and Control Sangyeun Cho Dept. of Computer Science A simple MIPS We will design a simple MIPS processor that supports a small instruction
More informationCS/COE0447: Computer Organization
A simple MIPS CS/COE447: Computer Organization and Assembly Language Datapath and Control Sangyeun Cho Dept. of Computer Science We will design a simple MIPS processor that supports a small instruction
More informationComputer Architecture Chapter 5. Fall 2005 Department of Computer Science Kent State University
Compter Architectre Chapter 5 Fall 25 Department of Compter Science Kent State University The Processor: Datapath & Control Or implementation of the MIPS is simplified memory-reference instrctions: lw,
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 informationMulticycle Approach. Designing MIPS Processor
CSE 675.2: Introduction to Computer Architecture Multicycle Approach 8/8/25 Designing MIPS Processor (Multi-Cycle) Presentation H Slides by Gojko Babić and Elsevier Publishing We will be reusing functional
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 informationMapping Control to Hardware
C A P P E N D I X A custom format such as this is slave to the architecture of the hardware and the instruction set it serves. The format must strike a proper compromise between ROM size, ROM-output decoding,
More informationUsing a Hardware Description Language to Design and Simulate a Processor 5.8
5.8 Using a Hardware Description Language to Design and Simulate a Processor 5.8 As mentioned in Appix B, Verilog can describe processors for simulation or with the intention that the Verilog specification
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 informationThe Processor (1) Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University
The Processor (1) 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 informationChapter 4 The Processor (Part 2)
Department of Electr rical Eng ineering, Chapter 4 The Processor (Part 2) 王振傑 (Chen-Chieh Wang) ccwang@mail.ee.ncku.edu.tw ncku edu Feng-Chia Unive ersity Outline A Multicycle Implementation Mapping Control
More informationDesign of the MIPS Processor
Design of the MIPS Processor We will study the design of a simple version of MIPS that can support the following instructions: I-type instructions LW, SW R-type instructions, like ADD, SUB Conditional
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 informationDesign of the MIPS Processor (contd)
Design of the MIPS Processor (contd) First, revisit the datapath for add, sub, lw, sw. We will augment it to accommodate the beq and j instructions. Execution of branch instructions beq $at, $zero, L add
More informationImplementing the Control. Simple Questions
Simple Questions How many cycles will it take to execute this code? lw $t2, 0($t3) lw $t3, 4($t3) beq $t2, $t3, Label add $t5, $t2, $t3 sw $t5, 8($t3) Label:... #assume not What is going on during the
More informationDigital Design & Computer Architecture (E85) D. Money Harris Fall 2007
Digital Design & Computer Architecture (E85) D. Money Harris Fall 2007 Final Exam This is a closed-book take-home exam. You are permitted a calculator and two 8.5x sheets of paper with notes. The exam
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 informationECE 3056: Architecture, Concurrency and Energy of Computation. Single and Multi-Cycle Datapaths: Practice Problems
ECE 3056: Architecture, Concurrency and Energy of Computation Single and Multi-Cycle Datapaths: Practice Problems 1. Consider the single cycle SPIM datapath. a. Specify the values of the control signals
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 informationThe Processor. Z. Jerry Shi Department of Computer Science and Engineering University of Connecticut. CSE3666: Introduction to Computer Architecture
The Processor Z. Jerry Shi Department of Computer Science and Engineering University of Connecticut CSE3666: Introduction to Computer Architecture Introduction CPU performance factors Instruction count
More informationInitial Representation Finite State Diagram Microprogram. Sequencing Control Explicit Next State Microprogram counter
Control Implementation Alternatives Control may be designed using one of several initial representations. The choice of sequence control, and how logic is represented, can then be determined independently;
More informationLECTURE 5. Single-Cycle Datapath and Control
LECTURE 5 Single-Cycle Datapath and Control PROCESSORS In lecture 1, we reminded ourselves that the datapath and control are the two components that come together to be collectively known as the processor.
More informationCENG 3420 Lecture 06: Datapath
CENG 342 Lecture 6: Datapath Bei Yu byu@cse.cuhk.edu.hk CENG342 L6. Spring 27 The Processor: Datapath & Control q We're ready to look at an implementation of the MIPS q Simplified to contain only: memory-reference
More informationCENG 3420 Computer Organization and Design. Lecture 06: MIPS Processor - I. Bei Yu
CENG 342 Computer Organization and Design Lecture 6: MIPS Processor - I Bei Yu CEG342 L6. Spring 26 The Processor: Datapath & Control q We're ready to look at an implementation of the MIPS q Simplified
More informationCOMP303 - Computer Architecture Lecture 8. Designing a Single Cycle Datapath
COMP33 - Computer Architecture Lecture 8 Designing a Single Cycle Datapath The Big Picture The Five Classic Components of a Computer Processor Input Control Memory Datapath Output The Big Picture: The
More informationReview: Abstract Implementation View
Review: Abstract Implementation View Split memory (Harvard) model - single cycle operation Simplified to contain only the instructions: memory-reference instructions: lw, sw arithmetic-logical instructions:
More informationChapter 4. The Processor. Computer Architecture and IC Design Lab
Chapter 4 The Processor Introduction CPU performance factors CPI Clock Cycle Time Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS
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 4.1 Introduction We will examine two MIPS implementations
More informationLecture Topics. Announcements. Today: Single-Cycle Processors (P&H ) Next: continued. Milestone #3 (due 2/9) Milestone #4 (due 2/23)
Lecture Topics Today: Single-Cycle Processors (P&H 4.1-4.4) Next: continued 1 Announcements Milestone #3 (due 2/9) Milestone #4 (due 2/23) Exam #1 (Wednesday, 2/15) 2 1 Exam #1 Wednesday, 2/15 (3:00-4:20
More informationECE232: Hardware Organization and Design
ECE232: Hardware Organization and Design Lecture 14: One Cycle MIPs Datapath Adapted from Computer Organization and Design, Patterson & Hennessy, UCB R-Format Instructions Read two register operands Perform
More informationCSE 2021 Computer Organization. Hugh Chesser, CSEB 1012U W10-M
CSE 22 Computer Organization Hugh Chesser, CSEB 2U Agenda Topics:. ultiple cycle implementation - complete Patterson: Appendix C, D 2 Breaking the Execution into Clock Cycles Execution of each instruction
More informationProcessor Implementation in VHDL. University of Ulster at Jordanstown University of Applied Sciences, Augsburg
University of Ulster at Jordanstown University of Applied Sciences, Augsburg Master of Engineering VLSI Design Project Report Processor Implementation in VHDL According to Computer Organisation & Design
More informationEECS150 - Digital Design Lecture 10- CPU Microarchitecture. Processor Microarchitecture Introduction
EECS150 - Digital Design Lecture 10- CPU Microarchitecture Feb 18, 2010 John Wawrzynek Spring 2010 EECS150 - Lec10-cpu Page 1 Processor Microarchitecture Introduction Microarchitecture: how to implement
More informationFinal Project: MIPS-like Microprocessor
Final Project: MIPS-like Microprocessor Objective: The objective of this project is to design, simulate, and implement a simple 32-bit microprocessor with an instruction set that is similar to a MIPS.
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 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 informationCPE 335 Computer Organization. Basic MIPS Architecture Part I
CPE 335 Computer Organization Basic MIPS Architecture Part I Dr. Iyad Jafar Adapted from Dr. Gheith Abandah slides http://www.abandah.com/gheith/courses/cpe335_s8/index.html CPE232 Basic MIPS Architecture
More informationComputer Organization and Structure. Bing-Yu Chen National Taiwan University
Computer Organization and Structure Bing-Yu Chen National Taiwan University The Processor Logic Design Conventions Building a Datapath A Simple Implementation Scheme An Overview of Pipelining Pipelined
More informationDesign of Digital Circuits Lecture 13: Multi-Cycle Microarch. Prof. Onur Mutlu ETH Zurich Spring April 2017
Design of Digital Circuits Lecture 3: Multi-Cycle Microarch. Prof. Onur Mutlu ETH Zurich Spring 27 6 April 27 Agenda for Today & Next Few Lectures! Single-cycle Microarchitectures! Multi-cycle and Microprogrammed
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 informationLecture 5: The Processor
Lecture 5: The Processor CSCE 26 Computer Organization Instructor: Saraju P. ohanty, Ph. D. NOTE: The figures, text etc included in slides are borrowed from various books, websites, authors pages, and
More informationThe Processor: Datapath and Control. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
The Processor: Datapath and Control Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Introduction CPU performance factors Instruction count Determined
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 informationThe overall datapath for RT, lw,sw beq instrucution
Designing The Main Control Unit: Remember the three instruction classes {R-type, Memory, Branch}: a) R-type : Op rs rt rd shamt funct 1.src 2.src dest. 31-26 25-21 20-16 15-11 10-6 5-0 a) Memory : Op rs
More informationLecture 2: MIPS Processor Example
Introduction to CMOS VLSI Design Lecture 2: MIPS Processor Example Outline Design Partitioning MIPS Processor Example Architecture t Microarchitecture Logic Design Circuit Design Physical Design Fabrication,
More informationThe Big Picture: Where are We Now? EEM 486: Computer Architecture. Lecture 3. Designing a Single Cycle Datapath
The Big Picture: Where are We Now? EEM 486: Computer Architecture Lecture 3 The Five Classic Components of a Computer Processor Input Control Memory Designing a Single Cycle path path Output Today s Topic:
More informationMIPS-Lite Single-Cycle Control
MIPS-Lite Single-Cycle Control COE68: Computer Organization and Architecture Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrical and Computer Engineering Ryerson University Overview Single cycle
More informationECE 30, Lab #8 Spring 2014
ECE 30, Lab #8 Spring 20 Shown above is a multi-cycle CPU. There are six special registers in this datapath: PC, IR, MDR, A, B, and ALUOut. Of these, PC and IR are enabled to change when PCWr and IRWr
More informationSingle Cycle CPU Design. Mehran Rezaei
Single Cycle CPU Design Mehran Rezaei What does it mean? Instruction Fetch Instruction Memory clk pc 32 32 address add $t,$t,$t2 instruction Next Logic to generate the address of next instruction The Branch
More informationEECS150 - Digital Design Lecture 9- CPU Microarchitecture. Watson: Jeopardy-playing Computer
EECS150 - Digital Design Lecture 9- CPU Microarchitecture Feb 15, 2011 John Wawrzynek Spring 2011 EECS150 - Lec09-cpu Page 1 Watson: Jeopardy-playing Computer Watson is made up of a cluster of ninety IBM
More informationECE Exam I - Solutions February 19 th, :00 pm 4:25pm
ECE 3056 Exam I - Solutions February 19 th, 2015 3:00 pm 4:25pm 1. (35 pts) Consider the following block of SPIM code. The text segment starts at 0x00400000 and the data segment starts at 0x10010000..data
More informationEECS 151/251A Fall 2017 Digital Design and Integrated Circuits. Instructor: John Wawrzynek and Nicholas Weaver. Lecture 13 EE141
EECS 151/251A Fall 2017 Digital Design and Integrated Circuits Instructor: John Wawrzynek and Nicholas Weaver Lecture 13 Project Introduction You will design and optimize a RISC-V processor Phase 1: Design
More informationTDT4255 Computer Design. Lecture 4. Magnus Jahre. TDT4255 Computer Design
1 TDT4255 Computer Design Lecture 4 Magnus Jahre 2 Outline Chapter 4.1 to 4.4 A Multi-cycle Processor Appendix D 3 Chapter 4 The Processor Acknowledgement: Slides are adapted from Morgan Kaufmann companion
More informationCOMP303 Computer Architecture Lecture 9. Single Cycle Control
COMP33 Computer Architecture Lecture 9 Single Cycle Control A Single Cycle Datapath We have everything except control signals (underlined) RegDst busw Today s lecture will look at how to generate the control
More informationAnnouncements. This week: no lab, no quiz, just midterm
CSC258 Week 7 Announcements This week: no lab, no quiz, just midterm 2 Recap ALU Multiplication 3 To implement multiplication, we basically repeatedly do three things AND (one-bit multiplication) Addition
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 informationECS 154B Computer Architecture II Spring 2009
ECS 154B Computer Architecture II Spring 2009 Pipelining Datapath and Control 6.2-6.3 Partially adapted from slides by Mary Jane Irwin, Penn State And Kurtis Kredo, UCD Pipelined CPU Break execution into
More information