Fall 2006 1 EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Computer Organization Study Guide 2 Exam 2 Thursday, November 9 Closed.

Slides:



Advertisements
Similar presentations
1 ITCS 3181 Logic and Computer Systems B. Wilkinson Slides9.ppt Modification date: March 30, 2015 Processor Design.
Advertisements

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering EE 333 Final Exam December 15, 2005 Instructions 1.Print your name, student.
Fall EE 333 Lillevik480f05-a2 University of Portland School of Engineering EE 333 Exam 2 November 10, 2005 Instructions 1.Print your name, student.
Multicycle Datapath & Control Andreas Klappenecker CPSC321 Computer Architecture.
1  1998 Morgan Kaufmann Publishers We will be reusing functional units –ALU used to compute address and to increment PC –Memory used for instruction and.
Fall EE 333 Lillevik 333f06-s3 University of Portland School of Engineering Computer Organization Final Exam Study Final Exam Tuesday, December.
CMPT 334 Computer Organization
Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering EE 333 Exam 2 November 9, 2006 Instructions 1.Print your name, student.
Fall EE 333 Lillevik333f06-a1 University of Portland School of Engineering EE 333 Exam 1 September 28, 2006 Instructions 1.Print your name, student.
Study Skills & Study Tips. Everyone is different, different methods work for different people The Following are only Suggestions on improving upon your.
Fall EE 333 Lillevik 333f06-l20 University of Portland School of Engineering Computer Organization Lecture 20 Pipelining: “bucket brigade” MIPS.
1 A few words about the quiz Closed book, but you may bring in a page of handwritten notes. –You need to know what the “core” MIPS instructions do. –I.
CS-447– Computer Architecture Lecture 12 Multiple Cycle Datapath
1 COMP541 Sequencing – III (Sequencing a Computer) Montek Singh April 9, 2007.
Fall 2007 MIPS Datapath (Single Cycle and Multi-Cycle)
CSCE 212 Quiz 9 – 3/30/11 1.What is the clock cycle time based on for single-cycle and for pipelining? 2.What two actions can be done to resolve data hazards?
Computer ArchitectureFall 2007 © October 3rd, 2007 Majd F. Sakr CS-447– Computer Architecture.
Preparation for Midterm Binary Data Storage (integer, char, float pt) and Operations, Logic, Flip Flops, Switch Debouncing, Timing, Synchronous / Asynchronous.
The Processor 2 Andreas Klappenecker CPSC321 Computer Architecture.
Computer ArchitectureFall 2007 © October 31, CS-447– Computer Architecture M,W 10-11:20am Lecture 17 Review.
Class 9.1 Computer Architecture - HUJI Computer Architecture Class 9 Microprogramming.
1 COMP541 Completing the MIPS Datapath Montek Singh Mar 27, 2007.
1 Sec (2.3) Program Execution. 2 In the CPU we have CU and ALU, in CU there are two special purpose registers: 1. Instruction Register 2. Program Counter.
Savannah-Chatham County Public Schools Woodville Tompkins Career & Technical Center Guidance Office Penny Stone.
Instruction Sets and Pipelining Cover basics of instruction set types and fundamental ideas of pipelining Later in the course we will go into more depth.
Lecture 16 Today’s topics: –MARIE Instruction Decoding and Control –Hardwired control –Micro-programmed control 1.
SURVIVAL SKILLS FOR (ENGINEERING) COLLEGE STUDENTS By Dr. Hong Zhang.
2/8/02CSE MultiCycle From One Cycle to Many Note: Some of the material in this lecture are COPYRIGHT 1998 MORGAN KAUFMANN PUBLISHERS, INC. ALL RIGHTS.
CS1104 – Computer Organization PART 2: Computer Architecture Lecture 12 Overview and Concluding Remarks.
Fall EE 333 Lillevik 333f06-l8 University of Portland School of Engineering Computer Organization Lecture 8 Detailed MIPS datapath Timing overview.
Fall EE 333 Lillevik333f06-s1 University of Portland School of Engineering Computer Organization Study Guide 1 Exam 1 Thursday, September 28 Closed.
For additional study information go to:
1 Control Unit Operation and Microprogramming Chap 16 & 17 of CO&A Dr. Farag.
Fall EE 333 Lillevik 333f06-l17 University of Portland School of Engineering Computer Organization Lecture 17 Controller design Microprogramming.
Fall EE 333 Lillevik 333f06-l13 University of Portland School of Engineering Computer Organization Lecture 13 Controller implementations Register.
Fall EE 333 Lillevik 333f06-l14 University of Portland School of Engineering Computer Organization Lecture 14 Memory hierarchy, locality Memory.
CS 1308 Exam 2 Review. Exam Format 110 Total Points 24 Points Short Answer 28 Points Fill in the Blank 16 Points T/F 36 Points Multiple Choice The above.
Fall EE 333 Lillevik 333f06-l18 University of Portland School of Engineering Computer Organization Lecture 18 IF, ID, R-type microprogramming Exam.
Spring EE 437 Lillevik 437s06-l5 University of Portland School of Engineering Advanced Computer Architecture Lecture 5 Slave bus agent ROM example.
MIPS Processor.
1 CS/COE0447 Computer Organization & Assembly Language Chapter 5 Part 3.
Fall EE 333 Lillevik 333f06-l16 University of Portland School of Engineering Computer Organization Lecture 16 Write-through, write-back cache Memory.
Test Taking & Study Skills By: Meagan Massey Test Taking Skills  Preparing for the Test  The Test  Post Test.
CS161 – Design and Architecture of Computer Systems
CS161 – Design and Architecture of Computer Systems
Computer Organization
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
CSCI206 - Computer Organization & Programming
Performance of Single-cycle Design
Systems Architecture I
Design of the Control Unit for Single-Cycle Instruction Execution
Design of the Control Unit for One-cycle Instruction Execution
The Multicycle Implementation
Lecturer: Alan Christopher
Serial versus Pipelined Execution
A Multiple Clock Cycle Instruction Implementation
Systems Architecture II
CSCI206 - Computer Organization & Programming
Processor Organization and Architecture
The Multicycle Implementation
The Processor Lecture 3.4: Pipelining Datapath and Control
Systems Architecture I
The Processor Lecture 3.1: Introduction & Logic Design Conventions
Guest Lecturer TA: Shreyas Chand
Multi-Cycle Datapath Lecture notes from MKP, H. H. Lee and S. Yalamanchili.
Systems Architecture I
A relevant question Assuming you’ve got: One washer (takes 30 minutes)
Computer Organization Lecture 19
CS161 – Design and Architecture of Computer Systems
Sec (2.3) Program Execution.
Presentation transcript:

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Computer Organization Study Guide 2 Exam 2 Thursday, November 9 Closed Book

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Describe the organization (key components) of the MIPS datapath: shared memory, ALU, registers, memory Explain the five MIPS instruction steps and what they do (IF, ID, EX, MEM, WB) Identify instruction steps on a timing diagram

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Determine the minimum clock period for synchronous system: T > T prop + T comb + T set Find F max for a computer system Explain an optimistic action Describe the function of the MIPS control signals

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Determine the MIPS control signals for: –Instruction fetch –Instruction decode, register read, and optimistic branch address –R-type execution and register write back

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Determine the MIPs control signals for: –Memory reference Effective address Memory access (write for store, read for load) Register write back (for load) –Beq execution –Jump execution

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Design a PC with the LS161 List the MIPS state transitions for a set of instructions Describe the organization (key components) of the MDP16 datapath Convert between MDP16 assembly and machine instructions

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Design a register file and determine the timing diagram Explain the goals of a memory hierarchy and the cost-capacity-speed relationships Describe the Principle of Locality Define the characteristics of ROM and RAM components

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Design a ROM and RAM memory system and determine the timing diagram For a memory system, find the length and width of memory components Explain how main memory relates to a direct-mapped cache

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Find the cache contents for a sequence of CPU writes Determine cache hit/miss for a sequence of CPU reads Calculate memory system average latency given hit rate and main/cache memory latencies

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Apply the expression for average latency to different memory designs Explain the performance advantage of write-back cache Determine if cache write-back is required for a sequence of CPU writes Explain how set associative cache operates

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills Compare the MIPS and MDP16 datapaths Describe the architecture and implementation options for a computer control unit Explain the advantages of microprogramming and the general steps Describe the function of the MDP16 control signals

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Skills List the MDP16 control signals to assert for a given operation Find the number of microinstructions for an instruction (same as number of clocks) Determine and interpret the instruction state diagram Microprogram the IF, ID steps

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Test Preparation Study in small groups –Focus on lecture and in-class problems –With serious students, some of same level –Go over problems, set them up, do not number crunch –Leave beer in refrigerator until done Make up a crib sheet: even though not allowed Don’t stay up all night, get good sleep

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Test Preparation Set up a backup for your alarm clock Eat breakfast, lunch, dinner Arrange alternate transportation to campus Bring everything you need for the exam –Pencils –Erasers

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Taking the test Put your name and student number on exam Read over the exam before writing Read each problem carefully, understand what was asked Show your work –Provide enough detail –Don’t do problem “in your head”

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Taking the test Think partial credit –Put something down for each question –If you are unclear, write down what you might do to solve the problem Stay in motion, budget your time –Work on a problem until you get stuck –Give it a couple more minutes, then move on –Return to the problem later

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Taking the test Keep your work legible If you don’t understand a problem, ask the instructor Don’t panic –If you find yourself sweating, hyperventilating, take a break –Take a few deep breaths, stretch –Then return to the exam

Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Taking the test Check your exam at the end –Did you answer every question & part? –Do your answers seem reasonable? –Do your answers check out? Hand in your paper when time is called