Fall 2005 1 EE 333 Lillevik480f05-a3 University of Portland School of Engineering EE 333 Final Exam December 15, 2005 Instructions 1.Print your name, student.

Slides:

Advertisements

Similar presentations

CS455/CpE 442 Intro. To Computer Architecure

Advertisements

Fall EE 333 Lillevik480f05-a2 University of Portland School of Engineering EE 333 Exam 2 November 10, 2005 Instructions 1.Print your name, student.

CIS 314 Fall 2005 MIPS Datapath (Single Cycle and Multi-Cycle)

Lecture Objectives: 1)Define pipelining 2)Calculate the speedup achieved by pipelining for a given number of instructions. 3)Define how pipelining improves.

Fall EE 333 Lillevik 333f06-s3 University of Portland School of Engineering Computer Organization Final Exam Study Final Exam Tuesday, December.

Fall EE 333 Lillevik 333f06-l4 University of Portland School of Engineering Computer Organization Lecture 4 Assembly language programming ALU and.

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.

Fall EE 333 Lillevik 333f06-l20 University of Portland School of Engineering Computer Organization Lecture 20 Pipelining: “bucket brigade” MIPS.

Pipelined Datapath and Control (Lecture #13) ECE 445 – Computer Organization The slides included herein were taken from the materials accompanying Computer.

Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 23 - Course.

Pipelining Andreas Klappenecker CPSC321 Computer Architecture.

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?

Instruction Representation I (1) Fall 2005 Lecture 05: INSTRUCTION REPRESENTATION.

Appendix A Pipelining: Basic and Intermediate Concepts

ECE 4436ECE 5367 ISA I. ECE 4436ECE 5367 CPU = Seconds= Instructions x Cycles x Seconds Time Program Program Instruction Cycle CPU = Seconds= Instructions.

ECE 353 ECE 353 Fall 2007 Lab 3 Machine Simulator November 1, 2007.

CS 300 – Lecture 6 Intro to Computer Architecture / Assembly Language Instructions.

1 I.Introduction to Algorithm and Programming Algoritma dan Pemrograman – Teknik Informatika UK Petra 2009.

Fall EE 333 Lillevik 333f06-l7 University of Portland School of Engineering Computer Organization Lecture 7 ALU design MIPS data path.

CSCI 136 Lab 1: 135 Review.

Fall EE 333 Lillevik 333f06-l8 University of Portland School of Engineering Computer Organization Lecture 8 Detailed MIPS datapath Timing overview.

Chapter 8 CPU and Memory: Design, Implementation, and Enhancement The Architecture of Computer Hardware and Systems Software: An Information Technology.

Fall EE 333 Lillevik 333f06-l21 University of Portland School of Engineering Computer Organization Lecture 21 Subroutines, stack Interrupts, service.

Fall EE 333 Lillevik333f06-s1 University of Portland School of Engineering Computer Organization Study Guide 1 Exam 1 Thursday, September 28 Closed.

Fall EE 333 Lillevik 333f06-l5 University of Portland School of Engineering Computer Organization Lecture 5 MIPS Instructions Loops Machine Instructions.

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.

Caches Where is a block placed in a cache? –Three possible answers  three different types AnywhereFully associativeOnly into one block Direct mappedInto.

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

ECE 353 Lab 2 Pipeline Simulator. Aims Further experience in C programming Handling strings Further experience in the use of assertions Reinforce concepts.

CS /02 Semester II Help Session IIA Performance Measures Colin Tan S

ECE 15B Computer Organization Spring 2011 Dmitri Strukov Partially adapted from Computer Organization and Design, 4 th edition, Patterson and Hennessy,

1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.

Caches Hiding Memory Access Times. PC Instruction Memory 4 MUXMUX Registers Sign Ext MUXMUX Sh L 2 Data Memory MUXMUX CONTROLCONTROL ALU CTL INSTRUCTION.

EE 3755 Datapath Presented by Dr. Alexander Skavantzos.

Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 January Session 2.

Fall EE 333 Lillevik 333f06-l18 University of Portland School of Engineering Computer Organization Lecture 18 IF, ID, R-type microprogramming Exam.

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Computer Organization Lecture 22 Project 6 Hard disk drive Bus arbitration.

Lecture 15: Pipelined Datapath Soon Tee Teoh CS 147.

Introduction to Computer Organization Pipelining.

Lecture 9. MIPS Processor Design – Pipelined Processor Design #1 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System.

Review for Quiz-1 Applied Operating System Concepts Patterson & Hennessy Chap.s 1,2,6,7 ECE3055b, Spring 2005

COSC 3330/6308 Second Review Session Fall Instruction Timings For each of the following MIPS instructions, check the cycles that each instruction.

CS 61C: Great Ideas in Computer Architecture Finite State Machines, Functional Units 1 Instructors: Vladimir Stojanovic and Nicholas Weaver

Fall EE 333 Lillevik 333f06-l16 University of Portland School of Engineering Computer Organization Lecture 16 Write-through, write-back cache Memory.

CS2100 Computer Organization

EE 333 Exam 1 September 29, 2005 Answers Instructions Name Student ID

Advanced Computer Architecture Lecture 14

ECE 353 Lab 3 Pipeline Simulator

ECS 154B Computer Architecture II Spring 2009

CDA 3101 Spring 2016 Introduction to Computer Organization

Pipelining: Advanced ILP

Test 1 Review Lectures 1-5.

MIPS Instruction Encoding

Datapath & Control MIPS

September 24 Test 1 review More programming

MIPS Instruction Encoding

Guest Lecturer TA: Shreyas Chand

CS455/CpE 442 Intro. To Computer Architecure

CS334: Memory _ Mars simulator Lab 4(part2-2)

COMP541 Datapaths I Montek Singh Mar 18, 2010.

Pipelining: Basic Concepts

October 29 Review for 2nd Exam Ask Questions! 4/26/2019

Computer Organization Lecture 19

Problem ??: (?? marks) Consider executing the following code on the MIPS pipelined datapath: add $t5, $t6, $t8 add $t9, $t5, $t4 lw $t3, 100($t9) sub $t2,

CS/COE0447 Computer Organization & Assembly Language

Advanced Computer Architecture Lecture 19

Presentation transcript:

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering EE 333 Final Exam December 15, 2005 Instructions 1.Print your name, student ID, and seat in the above blanks. 2.This is a Closed Book exam. 3.Do all of the problems. They may vary in points but the total is 100. Questions are short answer and problems. 4.Do not use any additional pages of paper. If you run out of room, use the back sides. Do not remove the staple. 5.Please write clearly or print. Illegible or unreadable answers may not be graded for partial credit. 6.Show your work. Mark your answer with a box or star. Name Student ID Seat Answers

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 1, (10 pts) 1.Convert hex 0xc4a to decimal? 2.Convert decimal 432 to hex? D = c x x a x 16 0 = 12 x x x 1 = = 3164 H : 432/16 = 27, R =0 : 27/16 = 1, R =11 : = 0x1B0

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering MIPS machine language (decimal) You may also use the following pseudo-instructions: la rdest, address lb rt, address sb rt, address

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 2, (10 pts) Find the machine instruction for sub $10, $6, $16 0x 00d R typeFields Size 6 bits5 bits 6 bits R typeoprsrtrdshamtfunct sub rd, rs, rt

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 3, (10 pts) probclocksns add0.242 sub lw sw0.242 j A.Assume F max = 2.0 GHz, complete the table (clocks, ns). B.Use the probability information to determine the average instruction time in ns. MIPS data path

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 4, (10 pts) A 16-bit computer is built entirely from the 7400LS logic family. Use only the following information to find the maximum clock frequency for the ideal case. Show units. setup = 10ns, hold=5ns, propagation=20ns, gate delay =10ns

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 5 (10 pts) Complete the 64x16 ROM design; fully decode for 0x00 start address.

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 6 ( 10 pts ) Cache memory indexVMtagdata 000YY100x NY110x NN010x YY000xabc 100YN010xdef 101YY110x YY100x NY000x789 CPU write adrhit?WB? NN, invalid YN YN NN YN NY NY NN, invalid For the direct mapped, write-back cache below, complete the table (Y or N)? WB = miss-modified

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 7 (10 pts) Determine the speedup S of a pipelined CPU with p stages as the number of instructions becomes infinitely large? Series Parallel

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 8 ( 10 pts ) A.What are the advantages of microprogramming? Solve large FSM problems Flexibility for changes Assembler can check for errors B.What are the general steps? edit source file assemble create µROM

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 9 ( 10 pts ) MDP16 system trace

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 9 ( 10 pts ), continued. 1.What machine instruction is executing at 6200 ns? 2.What is the optimistic branch address for the instruction executing at 7600 ns? 3.At 6800 ns, the instruction is a sw, what is the effective address? 4.At 8400 ns, the instruction is a sw, what is the data? 5.At 6000 ns, the instruction is an addi, what is the immediate data? 0xAC20 0x004A 0x0201 0x0095 0x0020

Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering Problem 10 (10 pts) Find an expression for the average access time T ave of a memory-hard disk hierarchy? Assume the page rate (hit) is p, memory access time is m, the I/O bus bandwidth is b, the size of a page is s bytes, a page is found dirty (modified) with probability d, and the free page list is always empty (memory full).