CS 61C: Great Ideas in Computer Architecture (Machine Structures) Lecture 28: Single-Cycle CPU Datapath Control Part 1 Guest Lecturer: Sagar Karandikar.

Slides:



Advertisements
Similar presentations
CS152 Lec9.1 CS152 Computer Architecture and Engineering Lecture 9 Designing Single Cycle Control.
Advertisements

EECC550 - Shaaban #1 Lec # 4 Summer Major CPU Design Steps 1Using independent RTN, write the micro- operations required for all target ISA.
361 datapath Computer Architecture Lecture 8: Designing a Single Cycle Datapath.
CS61C L19 CPU Design : Designing a Single-Cycle CPU (1) Beamer, Summer 2007 © UCB Scott Beamer Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L26 Single Cycle CPU Datapath II (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L20 Single-Cycle CPU Control (1) Beamer, Summer 2007 © UCB Scott Beamer Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
CS61C L17 Single Cycle CPU Datapath (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L26 CPU Design : Designing a Single-Cycle CPU II (1) Garcia, Spring 2007 © UCB 3.6 TB DVDs? Maybe!  Researchers at Harvard have found a way to use.
CS 61C L27 Single Cycle CPU Datapath, with Verilog II (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 25 CPU design (of a single-cycle CPU) Sat Google in Mountain.
EECC550 - Shaaban #1 Lec # 4 Winter CPU Organization Datapath Design: –Capabilities & performance characteristics of principal Functional.
CS 61C L34 Single Cycle CPU Control I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
Microprocessor Design
CS61C L25 Single Cycle CPU Datapath (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
ECE 232 L13. Control.1 ©UCB, DAP’ 97 ECE 232 Hardware Organization and Design Lecture 13 Control Design
CS61C L25 CPU Design : Designing a Single-Cycle CPU (1) Garcia, Fall 2006 © UCB T-Mobile’s Wi-Fi / Cell phone  T-mobile just announced a new phone that.
CS 61C L17 Control (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #17: CPU Design II – Control
CS61C L26 CPU Design : Designing a Single-Cycle CPU II (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 25 CPU design (of a single-cycle CPU) Intel is prototyping circuits that.
CS61C L25 CPU Design : Designing a Single-Cycle CPU (1) Garcia, Spring 2007 © UCB Google Summer of Code  Student applications are now open (through );
EECC550 - Shaaban #1 Lec # 4 Winter Major CPU Design Steps 1Using independent RTN, write the micro- operations required for all target.
EEM 486: Computer Architecture Lecture 3 Designing a Single Cycle Datapath.
CS61C L27 Single-Cycle CPU Control (1) Garcia, Spring 2010 © UCB inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 27 Single-cycle.
CS 61C L16 Datapath (1) A Carle, Summer 2004 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #16 – Datapath Andy.
CS61C L20 Single Cycle Datapath, Control (1) Chae, Summer 2008 © UCB Albert Chae, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
361 control Computer Architecture Lecture 9: Designing Single Cycle Control.
CS61C L26 CPU Design : Designing a Single-Cycle CPU II (1) Garcia, Spring 2010 © UCB inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures.
CS61CL L09 Single Cycle CPU Design (1) Huddleston, Summer 2009 © UCB Jeremy Huddleston inst.eecs.berkeley.edu/~cs61c CS61CL : Machine Structures Lecture.
ECE 232 L12.Datapath.1 Adapted from Patterson 97 ©UCBCopyright 1998 Morgan Kaufmann Publishers ECE 232 Hardware Organization and Design Lecture 12 Datapath.
ELEN 350 Single Cycle Datapath Adapted from the lecture notes of John Kubiatowicz(UCB) and Hank Walker (TAMU)
CS61C L27 Single Cycle CPU Control (1) Garcia, Fall 2006 © UCB Wireless High Definition?  Several companies will be working on a “WirelessHD” standard,
Instructor: Sagar Karandikar
CS3350B Computer Architecture Winter 2015 Lecture 5.6: Single-Cycle CPU: Datapath Control (Part 1) Marc Moreno Maza [Adapted.
Instructor: Sagar Karandikar
EEM 486: Computer Architecture Designing Single Cycle Control.
Computer Organization CS224 Fall 2012 Lesson 22. The Big Picture  The Five Classic Components of a Computer  Chapter 4 Topic: Processor Design Control.
Designing a Single Cycle Datapath In this lecture, slides from lectures 3, 8 and 9 from the course Computer Architecture ECE 201 by Professor Mike Schulte.
CS 61C: Great Ideas in Computer Architecture Datapath
EEM 486: Computer Architecture Designing a Single Cycle Datapath.
CPE 442 single-cycle datapath.1 Intro. To Computer Architecture CpE242 Computer Architecture and Engineering Designing a Single Cycle Datapath.
W.S Computer System Design Lecture 4 Wannarat Suntiamorntut.
Datapath and Control Unit Design
CS3350B Computer Architecture Winter 2015 Lecture 5.7: Single-Cycle CPU: Datapath Control (Part 2) Marc Moreno Maza [Adapted.
Designing a Single- Cycle Processor 國立清華大學資訊工程學系 黃婷婷教授.
By Wannarat Computer System Design Lecture 4 Wannarat Suntiamorntut.
CS4100: 計算機結構 Designing a Single-Cycle Processor 國立清華大學資訊工程學系 一零零學年度第二學期.
Machine Structures Lecture 19 – CPU Design: Designing a Single-cycle CPU, pt 2 Halloween plans?  Try the Castro, SF! halloweeninthecastro.com Tomorrow.
Instructor: Justin Hsia 7/23/2012Summer Lecture #201 CS 61C: Great Ideas in Computer Architecture MIPS CPU Datapath, Control Introduction.
Csci 136 Computer Architecture II –Single-Cycle Datapath Xiuzhen Cheng
EEM 486: Computer Architecture Lecture 3 Designing Single Cycle Control.
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Single-Cycle CPU Datapath & Control Part 2 Instructors: Krste Asanovic & Vladimir Stojanovic.
CS 61C L5.1.2 CPU Design II (1) K. Meinz, Summer 2004 © UCB CS61C : Machine Structures Lecture CPU Design II Kurt Meinz inst.eecs.berkeley.edu/~cs61c.
CS 110 Computer Architecture Lecture 11: Single-Cycle CPU Datapath & Control Instructor: Sören Schwertfeger School of Information.
CS 61C: Great Ideas in Computer Architecture MIPS Datapath 1 Instructors: Nicholas Weaver & Vladimir Stojanovic
CPU Design - Datapath. Review Use muxes to select among input S input bits selects 2 S inputs Each input can be n-bits wide, indep of S Can implement.
IT 251 Computer Organization and Architecture
(Chapter 5: Hennessy and Patterson) Winter Quarter 1998 Chris Myers
CPU Control Lecture 16 CDA
CpE242 Computer Architecture and Engineering Designing a Single Cycle Datapath Start: X:40.
Single Cycle CPU Design
Vladimir Stojanovic and Nicholas Weaver
Instructors: Randy H. Katz David A. Patterson
CS152 Computer Architecture and Engineering Lecture 8 Designing a Single Cycle Datapath Start: X:40.
COMS 361 Computer Organization
Instructors: Randy H. Katz David A. Patterson
COMS 361 Computer Organization
What You Will Learn In Next Few Sets of Lectures
Designing a Single-Cycle Processor
Processor: Datapath and Control
Presentation transcript:

CS 61C: Great Ideas in Computer Architecture (Machine Structures) Lecture 28: Single-Cycle CPU Datapath Control Part 1 Guest Lecturer: Sagar Karandikar

Technology In the News FPGAs are “programmable” hardware used by computer architects and digital circuit designers, lie somewhere between CPUs and custom chips (ASICs). “Microsoft published a paper at ISCA about using FPGAs in datacenters Microsoft “Catapult”, ISCA 2014 for page ranking processing for Bing. In a test deployment, MS reported up to 95% more throughput for only 10% more power. The added TCO was less than 30%. Microsoft used Altera Stratix V FPGAs in a PCIe form-factor with 8GB of DDR3 RAM on each board. The FPGAs were connected using a 10Gb SAS network.” - AnandTech

Review CPU design involves Datapath, Control – 5 Stages for MIPS Instructions 1.Instruction Fetch 2.Instruction Decode & Register Read 3.ALU (Execute) 4.Memory 5.Register Write Datapath timing: single long clock cycle or one short clock cycle per stage

Datapath and Control Datapath based on data transfers required to perform instructions Controller causes the right transfers to happen PC instruction memory +4 rt rs rd registers Data memory imm ALU Controller opcode, funct == zero

CPU Clocking (1/2) For each instruction, how do we control the flow of information though the datapath? Single Cycle CPU: All stages of an instruction completed within one long clock cycle – Clock cycle sufficiently long to allow each instruction to complete all stages without interruption within one cycle 1. Instruction Fetch 2. Decode/ Register Read 3. Execute4. Memory 5. Reg. Write

CPU Clocking (2/2) Alternative multiple-cycle CPU: only one stage of instruction per clock cycle – Clock is made as long as the slowest stage – Several significant advantages over single cycle execution: Unused stages in a particular instruction can be skipped OR instructions can be pipelined (overlapped) 1. Instruction Fetch 2. Decode/ Register Read 3. Execute4. Memory 5. Register Write

Agenda Stages of the Datapath Datapath Instruction Walkthroughs Datapath Design

Five Components of a Computer Processor Computer Control Datapath Memory (passive) (where programs, data live when running) Devices Input Output Keyboard, Mouse Display, Printer Disk (where programs, data live when not running)

Processor Design: 5 steps Step 1: Analyze instruction set to determine datapath requirements – Meaning of each instruction is given by register transfers – Datapath must include storage element for ISA registers – Datapath must support each register transfer Step 2: Select set of datapath components & establish clock methodology Step 3: Assemble datapath components that meet the requirements Step 4: Analyze implementation of each instruction to determine setting of control points that realizes the register transfer Step 5: Assemble the control logic

All MIPS instructions are 32 bits long. 3 formats: – R-type – I-type – J-type The different fields are: – op: operation (“opcode”) of the instruction – rs, rt, rd: the source and destination register specifiers – shamt: shift amount – funct: selects the variant of the operation in the “op” field – address / immediate: address offset or immediate value – target address: target address of jump instruction optarget address bits26 bits oprsrtrdshamtfunct bits 5 bits oprsrt address/immediate bits16 bits5 bits The MIPS Instruction Formats

ADDU and SUBU –addu rd,rs,rt –subu rd,rs,rt OR Immediate: –ori rt,rs,imm16 LOAD and STORE Word –lw rt,rs,imm16 –sw rt,rs,imm16 BRANCH: –beq rs,rt,imm16 oprsrtrdshamtfunct bits 5 bits oprsrtimmediate bits16 bits5 bits oprsrtimmediate bits16 bits5 bits oprsrtimmediate bits16 bits5 bits The MIPS-lite Subset

Colloquially called “Register Transfer Language” RTL gives the meaning of the instructions All start by fetching the instruction itself {op, rs, rt, rd, shamt, funct}  MEM[ PC ] {op, rs, rt, Imm16}  MEM[ PC ] Inst Register Transfers ADDU R[rd]  R[rs] + R[rt]; PC  PC + 4 SUBU R[rd]  R[rs] – R[rt]; PC  PC + 4 ORI R[rt]  R[rs] | zero_ext(Imm16); PC  PC + 4 LOAD R[rt]  MEM[ R[rs] + sign_ext(Imm16)]; PC  PC + 4 STORE MEM[ R[rs] + sign_ext(Imm16) ]  R[rt]; PC  PC + 4 BEQ if ( R[rs] == R[rt] ) PC  PC {sign_ext(Imm16), 2’b00} else PC  PC + 4 Register Transfer Level (RTL)

Step 1: Requirements of the Instruction Set Memory (MEM) – Instructions & data (will use one for each) Registers (R: 32, 32-bit wide registers) – Read RS – Read RT – Write RT or RD Program Counter (PC) Extender (sign/zero extend) Add/Sub/OR/etc unit for operation on register(s) or extended immediate (ALU) Add 4 (+ maybe extended immediate) to PC Compare registers?

Step 2: Components of the Datapath Combinational Elements Storage Elements + Clocking Methodology Building Blocks 32 A B Sum CarryOut CarryIn Adder 32 A B Y Select MUX Multiplexer 32 A B Result OP ALU Adder

ALU Needs for MIPS-lite + Rest of MIPS Addition, subtraction, logical OR, ==: ADDU R[rd] = R[rs] + R[rt];... SUBU R[rd] = R[rs] – R[rt];... ORI R[rt] = R[rs] | zero_ext(Imm16)... BEQ if ( R[rs] == R[rt] )... Test to see if output == 0 for any ALU operation gives == test. How? P&H also adds AND, Set Less Than (1 if A < B, 0 otherwise) ALU follows Chapter 5

Storage Element: Idealized Memory “Magic” Memory – One input bus: Data In – One output bus: Data Out Memory word is found by: – For Read: Address selects the word to put on Data Out – For Write: Set Write Enable = 1: address selects the memory word to be written via the Data In bus Clock input (CLK) – CLK input is a factor ONLY during write operation – During read operation, behaves as a combinational logic block: Address valid  Data Out valid after “access time” Clk Data In Write Enable 32 DataOut Address

Storage Element: Register (Building Block) Similar to D Flip Flop except – N-bit input and output – Write Enable input Write Enable: – Negated (or deasserted) (0): Data Out will not change – Asserted (1): Data Out will become Data In on positive edge of clock clk Data In Write Enable NN Data Out

Storage Element: Register File Register File consists of 32 registers: – Two 32-bit output busses: busA and busB – One 32-bit input bus: busW Register is selected by: – RA (number) selects the register to put on busA (data) – RB (number) selects the register to put on busB (data) – RW (number) selects the register to be written via busW (data) when Write Enable is 1 Clock input (clk) – Clk input is a factor ONLY during write operation – During read operation, behaves as a combinational logic block: RA or RB valid  busA or busB valid after “access time.” Clk busW Write Enable 32 busA 32 busB 555 RWRARB 32 x 32-bit Registers

Administrivia No classes on Tuesday – If you have discussion on Tuesday, go to a M/W discussion. Project 3-1 out Sunday – Free to choose new partners, but not forced – Start early! Heads Up: No Lab Thanksgiving Week

Step 3a: Instruction Fetch Unit Register Transfer Requirements  Datapath Assembly Instruction Fetch Read Operands and Execute Operation Common RTL operations – Fetch the Instruction: mem[PC] – Update the program counter: Sequential Code: PC  PC + 4 Branch and Jump: PC  “something else” 32 Instruction Word Address Instruction Memory PC clk Next Address Logic

R[rd] = R[rs] op R[rt] (addu rd,rs,rt) – Ra, Rb, and Rw come from instruction’s Rs, Rt, and Rd fields – ALUctr and RegWr: control logic after decoding the instruction … Already defined the register file & ALU Step 3b: Add & Subtract 32 Result ALUctr clk busW RegWr 32 busA 32 busB 555 RwRaRb 32 x 32-bit Registers RsRtRd ALU oprsrtrdshamtfunct bits 5 bits

Clocking Methodology Storage elements clocked by same edge Flip-flops (FFs) and combinational logic have some delays – Gates: delay from input change to output change – Signals at FF D input must be stable before active clock edge to allow signal to travel within the FF (set-up time), and we have the usual clock-to-Q delay “Critical path” (longest path through logic) determines length of clock period Clk

Register-Register Timing: One Complete Cycle Clk PC Rs, Rt, Rd, Op, Func ALUctr Instruction Memory Access Time Old Value New Value RegWrOld Value New Value Delay through Control Logic busA, B Register File Access Time Old ValueNew Value busW ALU Delay Old Value New Value Old ValueNew Value Old Value Register Write Occurs Here 32 ALUctr clk busW RegWr 32 busA 32 busB 55 RwRaRb RegFile RsRt ALU 5 Rd

Putting it All Together:A Single Cycle Datapath imm16 32 ALUctr clk busW RegWr 32 busA 32 busB 55 RwRaRb RegFile Rs Rt Rd RegDst Extender 3216 imm16 ALUSrcExtOp MemtoReg clk Data In 32 MemWr Equal Instruction Imm16RdRtRs clk PC 00 4 nPC_sel PC Ext Adr Inst Memory Adder Mux = ALU 0 1 WrEnAdr Data Memory 5

Processor Design: 3 of 5 steps Step 1: Analyze instruction set to determine datapath requirements – Meaning of each instruction is given by register transfers – Datapath must include storage element for ISA registers – Datapath must support each register transfer Step 2: Select set of datapath components & establish clock methodology Step 3: Assemble datapath components that meet the requirements Step 4: Analyze implementation of each instruction to determine setting of control points that realizes the register transfer Step 5: Assemble the control logic