CS2100 Tutorial #9 The Processor: Datapath and Control (Aaron Tan)

Slides:

Advertisements

Similar presentations

Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 13 - A Verilog.

Advertisements

Pipeline Example: cycle 1 lw R10,9(R1) sub R11,R2, R3 and R12,R4, R5 or R13,R6, R7.

Microprocessor Design Multi-cycle Datapath Nia S. Bradley Vijay.

EECE476 Lecture 7: Single-Cycle CPU Instruction Processing & Control Chapter 5, Sections 5.3, 5.4 The University of British ColumbiaEECE 476© 2005 Guy.

The Processor: Datapath & Control

CMPUT Computer Organization and Architecture II1 CMPUT229 - Fall 2003 TopicE: Building a Data Path and a Control Path for a Microprocessor José Nelson.

331 Lec 14.1Fall 2002 Review: Abstract Implementation View  Split memory (Harvard) model - single cycle operation  Simplified to contain only the instructions:

CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 TopicH: Building a Data Path and a Control Path for a Microprocessor José Nelson.

CS 61C discussion 11 (1) Jaein Jeong 2002 Draw the data path: ADD or SUB Clk 555 RwRaRb bit Registers Extender Clk WrEn Adr Data Memory ALU Instruction.

The Datapath Andreas Klappenecker CPSC321 Computer Architecture.

CS61C L27 Single Cycle CPU Control (1) Garcia, Fall 2006 © UCB Wireless High Definition?  Several companies will be working on a “WirelessHD” standard,

The Processor: Datapath & Control. Implementing Instructions Simplified instruction set memory-reference instructions: lw, sw arithmetic-logical instructions:

Chapter 4 Sections 4.1 – 4.4 Appendix D.1 and D.2 Dr. Iyad F. Jafar Basic MIPS Architecture: Single-Cycle Datapath and Control.

Supplementary notes for pipelining LW ____,____ SUB ____,____,____ BEQ ____,____,____ ; assume that, condition for branch is not satisfied OR ____,____,____.

Gary MarsdenSlide 1University of Cape Town Chapter 5 - The Processor  Machine Performance factors –Instruction Count, Clock cycle time, Clock cycles per.

Computer Organization CS224 Chapter 4 Part b The Processor Spring 2010 With thanks to M.J. Irwin, T. Fountain, D. Patterson, and J. Hennessy for some lecture.

CS2100 Computer Organisation

Computer Architecture and Design – ECEN 350 Part 6 [Some slides adapted from A. Sprintson, M. Irwin, D. Paterson and others]

CS3350B Computer Architecture Winter 2015 Lecture 5.7: Single-Cycle CPU: Datapath Control (Part 2) Marc Moreno Maza [Adapted.

1 A single-cycle MIPS processor  An instruction set architecture is an interface that defines the hardware operations which are available to software.

1 COMP541 Datapaths II & Control I Montek Singh Mar 22, 2010.

MIPS processor continued. In Class Exercise Question Show the datapath of a processor that supports only R-type and jr reg instructions.

1 Processor: Datapath and Control Single cycle processor –Datapath and Control Multicycle processor –Datapath and Control Microprogramming –Vertical and.

CSE331 W10.1Irwin&Li Fall 2006 PSU CSE 331 Computer Organization and Design Fall 2006 Week 10 Section 1: Mary Jane Irwin (

Chapter 4 From: Dr. Iyad F. Jafar Basic MIPS Architecture: Single-Cycle Datapath and Control.

PC Instruction Memory Address Instr. [31-0] 4 Fig 4.6 p 309 Instruction Fetch.

1 CS/COE0447 Computer Organization & Assembly Language Chapter 5 Part 2.

MIPS processor continued

Datapath and Control AddressInstruction Memory Write Data Reg Addr Register File ALU Data Memory Address Write Data Read Data PC Read Data Read Data.

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

MIPS processor continued. Performance Assume that – Memory access: 200ps – ALU and adders: 100 ps – Register file read: 50ps – Register file write: 10ps.

1 Chapter 5: Datapath and Control (Part 2) CS 447 Jason Bakos.

Lecture 9. MIPS Processor Design – Single-Cycle Processor Design Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System.

Chapter 4 From: Dr. Iyad F. Jafar Basic MIPS Architecture: Multi-Cycle Datapath and Control.

Lecture 5. MIPS Processor Design

Computer Architecture Lecture 6.  Our implementation of the MIPS is simplified memory-reference instructions: lw, sw arithmetic-logical instructions:

ECE/CS 552: Single Cycle Control Path

Single-cycle CPU Control

Access the Instruction from Memory

EE204 Computer Architecture

MIPS Microarchitecture Single-Cycle Processor Control

Single Cycle CPU - Control

Chapter 5: A Multi-Cycle CPU.

Single Cycle CPU.

Computer Architecture

Single Cycle Processor

Multi-Cycle CPU.

Discussion Session Week 10

MIPS processor continued

CS/COE0447 Computer Organization & Assembly Language

CSCI206 - Computer Organization & Programming

Single-Cycle CPU DataPath.

CS/COE0447 Computer Organization & Assembly Language

CSCI206 - Computer Organization & Programming

CS/COE0447 Computer Organization & Assembly Language

CS/COE0447 Computer Organization & Assembly Language

Systems Architecture II

CSE378 Midterm Review Moore’s Law -- What are the two versions?

The Processor Lecture 3.3: Single-cycle Implementation

The Processor Lecture 3.2: Building a Datapath with Control

COSC 2021: Computer Organization Instructor: Dr. Amir Asif

Control Unit (single cycle implementation)

MIPS processor continued

CS/COE0447 Computer Organization & Assembly Language

Control Unit (single cycle implementation)

The Processor: Datapath & Control.

COMS 361 Computer Organization

Processor: Datapath and Control

CS/COE0447 Computer Organization & Assembly Language

Presentation transcript:

CS2100 Tutorial #9 The Processor: Datapath and Control (Aaron Tan)

lw $24, 0($15) Q1(i) R[rt] = M[R[rs]+SignExtImm] Registers FileALUData Memory RR1RR2WRWDOpr1Opr2AddrWD RegDest RegWrite ALUSrc MemRead MemWrite MemToReg Branch ALUop ALUcontrol $15$24 0 MEM([$15]+0)[$15]0[$15]+0 [$24] Next PC value = PC + 4

beq $1, $3, 12 Q1(ii) If (R[rs]==R[rt]) PC=PC+4+BrAddr Registers FileALUData Memory RR1RR2WRWDOpr1Opr2AddrWD RegDest RegWrite ALUSrc MemRead MemWrite MemToReg Branch ALUop ALUcontrol $1$3 $3 or $0 X [$1]-[$3] or random [$1][$3][$1]-[$3] [$3] X Next PC value = PC + 4 or (PC+4) + (12×4)

sub $25, $20, $5 Q1(iii) R[rd] = R[rs] – R[rt] Registers FileALUData Memory RR1RR2WRWDOpr1Opr2AddrWD RegDest RegWrite ALUSrc MemRead MemWrite MemToReg Branch ALUop ALUcontrol $20$5$25 1 [$20] – [$5][$20][$5][$20] – [$5] [$5] Next PC value = PC + 4

Q2(a) AND instruction Inst-Mem (400)Reg.File (200) Control (100) MUX (ALUSrc) (30) ALU (120) MUX (MToR) (30) Reg.File (200) Not critical path = 980ps

Q2(b) LW instruction Inst-Mem (400)Reg.File (200) Control (100) ALU (120) MUX (MToR) (30) Reg.File (200) Not critical path = 1300ps Why is MUX (ALUSrc) not included this time? DataMem (350)

Q2(c) BEQ instruction Inst-Mem (400)Reg.File (200) Control (100) ALU (120) AND (20) Not critical path = 800ps MUX (ALUSrc) (30) MUX (PCSrc) (30) How about the green path: PC  Adder  MUX (PCSrc)? How about the purple path: Inst.Mem  SignExt  LeftShift  Adder  MUX(PCSrc)?

Q Correct Wrong Lab #9: sayHi.asm

A spare diagram for your use.