ELEC 5200/6200 Computer Architecture and Design Spring 2017 Lecture 4: Datapath and Control
|
|
- Rosa Powers
- 6 years ago
- Views:
Transcription
1 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 Adapted from Dr. Chen-Huan Chiang (Intel) and Prof. Vishwani D. Agrawal (Auburn University) [Adapted from Computer Organization and Design, Patterson & Hennessy, 214] 2/6/217 ELEC 52-1/62-1 Lecture 4 1
2 Von Neumann Kitchen Start ALU Control Registers PC My choice Processor Program Data Input Memory Output 2/6/217 ELEC 52-1/62-1 Lecture 4 2
3 Where Does It All Begin? In a register called program counter (PC). PC contains the memory address of the next instruction to be executed. In the beginning, PC contains the address of the memory location where the program begins. 2/6/217 ELEC 52-1/62-1 Lecture 4 3
4 Where is the Program? Processor Memory Program counter (register) Start address Machine code of program 2/6/217 ELEC 52-1/62-1 Lecture 4 4
5 How Does It Run? Start PC has memory address where program begins Fetch instruction word from memory address in PC and increment PC PC + 4 to point to next instruction Decode instruction Execute instruction Save result in register or memory No Program complete? Yes STOP 2/6/217 ELEC 52-1/62-1 Lecture 4 5
6 Datapath and Control Datapath Memory, registers, adders, ALU, and communication buses. Each step (fetch, decode, execute, save result) requires communication (data transfer) paths between memory, registers and ALU. Control Datapath for each step is set up by control signals that set up dataflow directions on communication buses and select ALU and memory functions. Control signals are generated by a control unit consisting of one or more finite-state machines. 2/6/217 ELEC 52-1/62-1 Lecture 4 6
7 Single-Cycle Processor Simplified MIPS - Datapath
8 Registers ALU Add Abstract View of MIPS 4 Data PC Address Instruction Instruction memory Register # Register # Register # Address Data Memory Data 2/6/217 ELEC 52-1/62-1 Lecture 4 8
9 Add Instruction Fetch instructions from Instruction Memory Update PC for next instruction 4 Instruction Memory PC Address Instruction 2/6/217 ELEC 52-1/62-1 Lecture 4 9
10 Register File: A Datapath Component registers 5 5 Reg 1 Reg 2 32 Reg 1 Data Write register Write Data 5 32 Register File 32 Reg 2 Data RegWrite 2/6/217 ELEC 52-1/62-1 Lecture 4 1
11 Instruction Decode R-Type 6-bit Opcode and 6-bit funct to Control Unit two registers (rs and rt) Control Unit Instruction I-Type 6-bit Opcode to Control Unit one register (rs) J-Type? Reg 1 Reg 2 Register File Write Reg Write Data Data 1 Data 2 2/6/217 ELEC 52-1/62-1 Lecture 4 11
12 Execute: R-Type opcode rs rt rd shamt funct RegWrite ALU Operation Instruction Reg 1 Reg 2 Data 1 Register File Write Reg Data 2 Write Data ALU zero Why RegWrite? 2/6/217 ELEC 52-1/62-1 Lecture 4 12
13 Execute: Load/Store opcode rs rt 16-bit address RegWrite ALU operation MemWrite Instruction Reg 1 Reg 2 Write Reg Write Data Data 1 Data 2 ALU zero Address Data Memory Write Data Data Signextend Mem lw $rt, offset($rs) sw $rt, offset($rs) 2/6/217 ELEC 52-1/62-1 Lecture 4 13
14 ALU Add Add Execute: Branch bne $t, $t1, Label beq $t, $t1, Label 4 Shift left 2 Branch target address ALU operation PC Instruction Reg 1 Reg 2 Register File Write Reg Write Data Data 1 Data 2 zero (To branch control logic) 16 Sign Extend 32 2/6/217 ELEC 52-1/62-1 Lecture 4 14
15 Add Execute: Jump Jump operation involves Update lower 28 bits of the PC Lower 26 bits of the fetched instruction shifted left by 2 bits (converting to byte address) op 26-bit address 4 4 MSBs of PC+4 PC Address Instruction Memory Instruction 26 Shift left 2 28 Jump address 2/6/217 ELEC 52-1/62-1 Lecture 4 15
16 Assembling Datapath Assemble the datapath segments Add control lines and multiplexors as needed Single cycle design fetch, decode and execute each instructions all in one clock cycle No datapath resource can be used more than once per instruction Must be duplicated if needed (e.g., separate Instruction Memory and Data Memory, several adders) Multiplexors needed at the input of shared elements with control lines to do the selection Write signals to control writing to the Register File and Data Memory Cycle time is determined by length of the longest path 2/6/217 ELEC 52-1/62-1 Lecture 4 16
17 Add Add Datapath (Except Jump) 4 ALUOp Shift left 2 1 Instr[31-26] Control Unit RegWrite ALUSrc PCSrc MemWrite MemtoReg RegDst zero PC Address Instruction Memory Instr[31-] Instr[25-21] Instr[2-16] Instr 1 [15-11] Reg 1 Reg 2 Register File Write Addr Write Data Data 1 Data 2 1 ALU Address Data Memory Write Data Data 1 Instr[15-] Sign 16 Extend 32 ALU control Mem Instr[5-]
18 Add Add Datapath and Control (Except Jump) 4 ALUOp Branch Shift left 2 1 PCSrc Instr[31-26] RegDst Control Unit RegWrite ALUSrc MemWrite MemtoReg PC Address Instruction Memory Instr[31-] Instr[25-21] Instr[2-16] Instr 1 [15-11] Reg 1 Reg 2 Register File Write Addr Write Data Data 1 Data 2 1 ALU Address Data Memory Write Data Data 1 Instr[15-] Sign 16 Extend 32 ALU control Mem Instr[5-]
19 Arithmetic Logic Unit (ALU) Operation select ALU function AND 1 OR 1 Add 11 Subtract 111 Set on less than 11 NOR Operation select from control ALU 4 zero overflow result zero = 1, when all bits of result are 2/6/217 ELEC 52-1/62-1 Lecture 4 19
20 Building a 32 bit ALU 2/6/217 ELEC 52-1/62-1 Lecture 4 2
21 1-Bit ALU: AND, OR, ADD, SUB, NOR 2/6/217 ELEC 52-1/62-1 Lecture 4 21
22 slt produces a 1 if rs < rt and otherwise Use subtraction: (a-b) < implies a < b ALU: slt 2/6/217 ELEC 52-1/62-1 Lecture 4 22
23 ALU: Branch 2/6/217 ELEC 52-1/62-1 Lecture 4 23
24 ALU Control ALU Control Lines Function AND 1 OR 1 add 11 subtract 111 set on less than 11 NOR 2/6/217 ELEC 52-1/62-1 Lecture 4 24
25 Single-Cycle Processor Simplified MIPS - Control
26 Datapath and Control (Except Jump) Instruction RegDst ALUSrc Memto-Reg Reg Write Mem Mem Write Branch ALUOp1 ALUp R-format lw sw X 1 X 1 beq X X 1 1
27 ALU Control Load and store word instructions, ALU computes the target memory address by addition Base address + displacement Base register + sign_ext(imm16) R-type instructions ALU performs one of the following 5 actions depending on the value of the 6-bit funct field AND, OR, subtract, add, set on less than Branch ALU performs a subtraction Check the output ZERO We can use 2 bits of opcode (Instr[31:26]) as ALUop to distinguish the above 3 types of instructions lw/sw (), beq (1), R-type (1) Note that the binary encoding (11) is not used 2/6/217 ELEC 52-1/62-1 Lecture 4 27
28 Recall: ALU Control Inputs 4 bits required for ALU control inputs, ALUctr Remember this in ALU design? = and 1 = or 1 = add 11 = subtract 111 = slt 11 = NOR opcode funct funct op Main 6? 6 Control ALUop 2 ALUctr 4 To ALU 2/6/217 ELEC 52-1/62-1 Lecture 4 28
29 What s in the box? op 6 Main Control funct 6 ALUop 2 ALU Control ALUctr 4 To ALU Opcode ALUOp Operation Function Code Desired ALU action ALU control input LW Load word xxxxxx add 1 SW Store word xxxxxx add 1 Branch equal 1 Branch equal xxxxxx subtract 11 R-type 1 Addition 1 add 1 R-type 1 Subtraction 11 subtract 11 R-type 1 AND 11 and R-type 1 OR 111 or 1 R-type 1 Set-on-less-than 111 set-on-less-than 111 ALUOp Function code ALU control ALUOp1 ALUOp F5 F4 F3 F2 F1 F input X X X X X X 1 X 1 X X X X X X 11 1 X X X 1 1 X X X X X X 1 1 X X X X X X
30 Add Add Control Unit 4 ALUOp Branch Shift left 2 1 PCSrc Instr[31-26] RegDst Control Unit RegWrite ALUSrc MemWrite MemtoReg PC Address Instruction Memory Instr[31-] Instr[25-21] Instr[2-16] Instr 1 [15-11] Reg 1 Reg 2 Register File Write Addr Write Data Data 1 Data 2 1 ALU Address Data Memory Write Data Data 1 Instr[15-] Sign 16 Extend 32 ALU control Mem Instr[5-]
31 R-Type Instructions add $x, $y, $z R-type: op rs rt rd shamt funct Instruction Fetch (IF): An instruction is fetched from the instruction memory and the PC is incremented. Instruction Decode (ID): Two registers, $y and $z, are read from the register file. Execution (EX): The ALU operates on the data read from the register file, using the function code (bits 5- of the instruction) to generate the ALU function. Write Back (WB): The result from the ALU is written into the register file using bits of the instruction to select the destination register ($x). 2/6/217 ELEC 52-1/62-1 Lecture 4 31
32 Add Add R-Type Instructions add $x, $y, $z 4 ALUOp Branch Shift left 2 1 PCSrc Instr[31-26] RegDst Control Unit RegWrite ALUSrc MemWrite MemtoReg PC Address Instruction Memory Instr[31-] Instr[25-21] Instr[2-16] Instr 1 [15-11] Reg 1 Reg 2 Register File Write Addr Write Data Data 1 Data 2 1 ALU Address Data Memory Write Data Data 1 Instr[15-] Sign 16 Extend 32 ALU control Mem Instr[5-] 1
33 I-Type: Load lw $x, offset ($y) I-type: op rs rt offset Instruction Fetch (IF): An instruction is fetched from the instruction memory and the PC is incremented. Instruction Decode (ID): A register ($y) value is read from the register file. Address Calculation (EX): The ALU computes the sum of the value read from the register file and the sign-extended lower 16 bits of the instruction (offset). Memory Operation (MEM): The sum from the ALU is used as the address for the data memory. Write Back (WB): The data from the memory unit is written into the register file; the register destination is given by bits 2-16 of the instruction ($x). 2/6/217 ELEC 52-1/62-1 Lecture 4 33
34 Add Add I-Type: Load lw $x, offset ($y) 4 ALUOp Branch Shift left 2 1 PCSrc Instr[31-26] RegDst Control Unit RegWrite ALUSrc MemWrite MemtoReg PC Address Instruction Memory Instr[31-] Instr[25-21] Instr[2-16] Instr 1 [15-11] Reg 1 Reg 2 Register File Write Addr Write Data Data 1 Data 2 1 ALU Address Data Memory Write Data Data 1 Instr[15-] Sign 16 Extend 32 ALU control Mem Instr[5-]
35 I-Type : Branch beq $x, $y, offset I-type: op rs rt offset Instruction Fetch (IF): An instruction is fetched from the instruction memory and the PC is incremented. Instruction Decode (ID): Two registers, $x and $y, are read from the register file. Branch Address calculation (EX): The ALU performs a subtract on the data values read from the register file. The value of PC + 4 is added to the sign-extended lower 16 bits of the instruction (offset); the result is the branch target address. Branch Decision: The Zero result from the ALU is used to decide which adder result to store into the PC. 2/6/217 ELEC 52-1/62-1 Lecture 4 35
36 Add Add I-Type: beq beq $x, $y, offset 4 ALUOp Branch Shift left 2 1 PCSrc Instr[31-26] RegDst Control Unit RegWrite ALUSrc MemWrite MemtoReg PC Address Instruction Memory Instr[31-] Instr[25-21] Instr[2-16] Instr 1 [15-11] Reg 1 Reg 2 Register File Write Addr Write Data Data 1 Data 2 1 ALU Address Data Memory Write Data Data 1 Instr[15-] Sign 16 Extend 32 ALU control Mem Instr[5-] 1
37 Control Signals Instruction RegDst ALUSrc Memto-Reg Reg Write Mem Mem Write Branch ALUOp1 ALUp R-format lw sw X 1 X 1 beq X X 1 1 op[] op[5] Control Unit RegDst ALUSrc ALUp1 ALUp 2/6/217 ELEC 52-1/62-1 Lecture 4 37
38 Adding jump hardware op 26-bit address Note: the 26-bit address is a word address Must be multiplied by 4 to obtain the byte address, i.e. shift-left-by 2 Low order 26 bits of the jump instruction 26 PC[31:28] or PC+4[31:28]? 4 PC /6/217 ELEC 52-1/62-1 Lecture 4 38
39 Add Add 4 Instr[25-] Shift left ALUOp PC[31-28] jump Branch RegWrite Jump 32 Shift left 2 1 PCSrc 1 Instr[31-26] RegDst Control Unit ALUSrc MemWrite MemtoReg PC Address Instruction Memory Instr[31-] Instr[25-21] Instr[2-16] Instr 1 [15-11] Reg 1 Reg 2 Register File Write Addr Write Data Data 1 Data 2 1 ALU Address Data Memory Write Data Data 1 Instr[15-] Sign 16 Extend 32 ALU control Mem Instr[5-]
40 Limitations Inefficient clocking Clock cycle must be timed to accommodate the slowest instruction Problematic for more complex instructions like floating point multiply Clk Cycle 1 Cycle 2 lw sw Waste May be wasteful of area since some functional units (e.g., adders) must be duplicated since they can not be shared during a clock cycle BUT it is simple and easy to understand Especially the design of the main control unit Combinational logic 2/6/217 ELEC 52-1/62-1 Lecture 4 4
41 lk Clk Clk Registers ALU Add Critical Path (Load) Critical Path = PC s Clk-to-Q + Instruction Memory s Access Time + Register File s Access Time + ALU to Perform a 32-bit Add + Data Memory Access Time + Setup Time for Register File Write + Clock Skew 4 Register file and ideal memory: The CLK input is a factor ONLY during write operation During read operation, behave as combinational logic: Address valid => Output valid after access time. (i.e. delay) Data Register # PC Address Instruction Register # Address Instruction memory Register # Data Memory Data
42 Arithmetic & Logical Cycle Time IF ID EXE WB Load IF ID EXE MEM WB Critical Path Store IF ID EXE MEM Branch IF ID EXE 2/6/217 ELEC 52-1/62-1 Lecture 4 42
43 Multicycle Datapath Approach Let an instruction take more than 1 clock cycle to complete Break up instructions into steps where each step takes a cycle while trying to Balance the amount of work to be done in each step Restrict each cycle to use only one major functional unit Not every instruction takes the same number of clock cycles In addition to faster clock rates, multicycle allows functional units that can be used more than once per instruction as long as they are used in different clock cycles, hence One memory but only one memory access per cycle Recall instruction and data memory in single-cycle processor One ALU/adder but only one ALU operation per cycle Recall one adder for PC+4 and one ALU/adder for others in single-cycle processor 2/6/217 ELEC 52-1/62-1 Lecture 4 43
44 Reducing Cycle Time Cut combinational dependency graph and insert register / latch Do the same work in two fast cycles, rather than one slow one storage element storage element Acyclic Combinational Logic Acyclic Combinational Logic (A) => storage element storage element Acyclic Combinational Logic (B) 2/6/217 ELEC 52-1/62-1 Lecture 4 storage element 44
45 MDR B ALUout PC A IR Multicycle Datapath Abstract View End of a cycle All data needed in subsequent clock cycles must be stored in an internal register (not visible to the programmers). All (except IR) hold data only between a pair of adjacent clock cycles (no write control signal for the internal register is needed) Address Memory Data (Instr. or Data) Write Data Reg 1 Reg 2Data 1 Register File Write Addr Write Data Data 2 ALU Single Memory Unit, Single ALU, Temporary registers after major functional unit IR Instruction Register MDR Memory Data Register A, B regfile read data registers ALUout ALU output register 2/6/217 ELEC 52-1/62-1 Lecture 4 45
46 Next: Pipelining
ECE232: 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle
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 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 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 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 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 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 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 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 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 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 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 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 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 informationCPU Organization (Design)
ISA Requirements CPU Organization (Design) Datapath Design: Capabilities & performance characteristics of principal Functional Units (FUs) needed by ISA instructions (e.g., Registers, ALU, Shifters, Logic
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 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 informationThe Processor: Datapath & Control
Orange Coast College Business Division Computer Science Department CS 116- Computer Architecture The Processor: Datapath & Control Processor Design Step 3 Assemble Datapath Meeting Requirements Build the
More informationLecture 4: Review of MIPS. Instruction formats, impl. of control and datapath, pipelined impl.
Lecture 4: Review of MIPS Instruction formats, impl. of control and datapath, pipelined impl. 1 MIPS Instruction Types Data transfer: Load and store Integer arithmetic/logic Floating point arithmetic Control
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 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 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 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 informationChapter 4. The Processor. Instruction count Determined by ISA and compiler. We will examine two MIPS implementations
Chapter 4 The Processor Part I 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
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 informationChapter 4 The Processor 1. Chapter 4A. The Processor
Chapter 4 The Processor 1 Chapter 4A The Processor Chapter 4 The Processor 2 Introduction CPU performance factors Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware
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 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 informationThe MIPS Processor Datapath
The MIPS Processor Datapath Module Outline MIPS datapath implementation Register File, Instruction memory, Data memory Instruction interpretation and execution. Combinational control Assignment: Datapath
More informationECE260: Fundamentals of Computer Engineering
Datapath for a Simplified Processor James Moscola Dept. of Engineering & Computer Science York College of Pennsylvania Based on Computer Organization and Design, 5th Edition by Patterson & Hennessy Introduction
More informationLecture 10: Simple Data Path
Lecture 10: Simple Data Path Course so far Performance comparisons Amdahl s law ISA function & principles What do bits mean? Computer math Today Take QUIZ 6 over P&H.1-, before 11:59pm today How do computers
More informationCSEN 601: Computer System Architecture Summer 2014
CSEN 601: Computer System Architecture Summer 2014 Practice Assignment 5 Solutions Exercise 5-1: (Midterm Spring 2013) a. What are the values of the control signals (except ALUOp) for each of the following
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 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 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 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 informationCS3350B Computer Architecture Quiz 3 March 15, 2018
CS3350B Computer Architecture Quiz 3 March 15, 2018 Student ID number: Student Last Name: Question 1.1 1.2 1.3 2.1 2.2 2.3 Total Marks The quiz consists of two exercises. The expected duration is 30 minutes.
More informationInf2C - Computer Systems Lecture Processor Design Single Cycle
Inf2C - Computer Systems Lecture 10-11 Processor Design Single Cycle Boris Grot School of Informatics University of Edinburgh Previous lectures Combinational circuits Combinations of gates (INV, AND, OR,
More informationChapter 4. The Processor Designing the datapath
Chapter 4 The Processor Designing the datapath Introduction CPU performance determined by Instruction Count Clock Cycles per Instruction (CPI) and Cycle time Determined by Instruction Set Architecure (ISA)
More informationSingle Cycle Datapath
Single Cycle atapath Lecture notes from MKP, H. H. Lee and S. Yalamanchili Section 4.1-4.4 Appendices B.3, B.7, B.8, B.11,.2 ing Note: Appendices A-E in the hardcopy text correspond to chapters 7-11 in
More informationCPU Design Steps. EECC550 - Shaaban
CPU Design Steps 1. Analyze instruction set operations using independent RTN => datapath requirements. 2. Select set of datapath components & establish clock methodology. 3. Assemble datapath meeting the
More informationAdding Support for jal to Single Cycle Datapath (For More Practice Exercise 5.20)
Adding Support for jal to Single Cycle Datapath (For More Practice Exercise 5.20) The MIPS jump and link instruction, jal is used to support procedure calls by jumping to jump address (similar to j ) and
More informationCpE242 Computer Architecture and Engineering Designing a Single Cycle Datapath
CpE242 Computer Architecture and Engineering Designing a Single Cycle Datapath CPE 442 single-cycle datapath.1 Outline of Today s Lecture Recap and Introduction Where are we with respect to the BIG picture?
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 informationSingle Cycle Datapath
Single Cycle atapath Lecture notes from MKP, H. H. Lee and S. Yalamanchili Section 4.-4.4 Appendices B.7, B.8, B.,.2 Practice Problems:, 4, 6, 9 ing (2) Introduction We will examine two MIPS implementations
More informationFull Datapath. CSCI 402: Computer Architectures. The Processor (2) 3/21/19. Fengguang Song Department of Computer & Information Science IUPUI
CSCI 42: Computer Architectures The Processor (2) Fengguang Song Department of Computer & Information Science IUPUI Full Datapath Branch Target Instruction Fetch Immediate 4 Today s Contents We have looked
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 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 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 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 informationCS Computer Architecture Spring Week 10: Chapter
CS 35101 Computer Architecture Spring 2008 Week 10: Chapter 5.1-5.3 Materials adapated from Mary Jane Irwin (www.cse.psu.edu/~mji) and Kevin Schaffer [adapted from D. Patterson slides] CS 35101 Ch 5.1
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 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 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 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 informationCSE Computer Architecture I Fall 2009 Lecture 13 In Class Notes and Problems October 6, 2009
CSE 30321 Computer Architecture I Fall 2009 Lecture 13 In Class Notes and Problems October 6, 2009 Question 1: First, we briefly review the notion of a clock cycle (CC). Generally speaking a CC is the
More information361 datapath.1. Computer Architecture EECS 361 Lecture 8: Designing a Single Cycle Datapath
361 datapath.1 Computer Architecture EECS 361 Lecture 8: Designing a Single Cycle Datapath Outline of Today s Lecture Introduction Where are we with respect to the BIG picture? Questions and Administrative
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 informationComputer and Information Sciences College / Computer Science Department The Processor: Datapath and Control
Computer and Information Sciences College / Computer Science Department The Processor: Datapath and Control Chapter 5 The Processor: Datapath and Control Big Picture: Where are We Now? Performance of a
More informationCS 61C: Great Ideas in Computer Architecture. MIPS CPU Datapath, Control Introduction
CS 61C: Great Ideas in Computer Architecture MIPS CPU Datapath, Control Introduction Instructor: Alan Christopher 7/28/214 Summer 214 -- Lecture #2 1 Review of Last Lecture Critical path constrains clock
More informationSingle-Cycle Examples, Multi-Cycle Introduction
Single-Cycle Examples, ulti-cycle Introduction 1 Today s enu Single cycle examples Single cycle machines vs. multi-cycle machines Why multi-cycle? Comparative performance Physical and Logical Design of
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 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 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 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 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 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 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 informationCSCI 402: Computer Architectures. Fengguang Song Department of Computer & Information Science IUPUI. Today s Content
3/6/8 CSCI 42: Computer Architectures The Processor (2) Fengguang Song Department of Computer & Information Science IUPUI Today s Content We have looked at how to design a Data Path. 4.4, 4.5 We will design
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 informationIntroduction. ENG3380 Computer Organization and Architecture MIPS: Data Path Design Part 3. Topics. References. School of Engineering 1
ENG8 Computer Organization and rchitecture MIPS: Data Path Design Part Winter 7 S. reibi School of Engineering University of Guelph Introduction Topics uilding a Complete Data Path for MIPS Multi Cycle
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 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 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 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 informationCS3350B Computer Architecture Winter Lecture 5.7: Single-Cycle CPU: Datapath Control (Part 2)
CS335B Computer Architecture Winter 25 Lecture 5.7: Single-Cycle CPU: Datapath Control (Part 2) Marc Moreno Maza www.csd.uwo.ca/courses/cs335b [Adapted from lectures on Computer Organization and Design,
More informationLaboratory 5 Processor Datapath
Laboratory 5 Processor Datapath Description of HW Instruction Set Architecture 16 bit data bus 8 bit address bus Starting address of every program = 0 (PC initialized to 0 by a reset to begin execution)
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 informationENGN1640: Design of Computing Systems Topic 04: Single-Cycle Processor Design
ENGN64: Design of Computing Systems Topic 4: Single-Cycle Processor Design Professor Sherief Reda http://scale.engin.brown.edu Electrical Sciences and Computer Engineering School of Engineering Brown University
More informationDesign of Digital Circuits 2017 Srdjan Capkun Onur Mutlu (Guest starring: Frank K. Gürkaynak and Aanjhan Ranganathan)
Microarchitecture Design of Digital Circuits 27 Srdjan Capkun Onur Mutlu (Guest starring: Frank K. Gürkaynak and Aanjhan Ranganathan) http://www.syssec.ethz.ch/education/digitaltechnik_7 Adapted from Digital
More informationData paths for MIPS instructions
You are familiar with how MIPS programs step from one instruction to the next, and how branches can occur conditionally or unconditionally. We next examine the machine level representation of how MIPS
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 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 information361 control.1. EECS 361 Computer Architecture Lecture 9: Designing Single Cycle Control
36 control. EECS 36 Computer Architecture Lecture 9: Designing Single Cycle Control Recap: The MIPS Subset ADD and subtract add rd, rs, rt sub rd, rs, rt OR Imm: ori rt, rs, imm6 3 3 26 2 6 op rs rt rd
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 information