finalexamfall05 - word addresses The cache is assumed to be...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Organization CDA-3103 Final Exam Fall 2005 Be lucid and neat. Justify all your answers. 75 mins. Closed book, Closed notes, No calculator. Name: Grade:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Q1 (20 pts.) A program runs in 8 seconds on machine A, which has a clock frequency of 2 GHz. You are required to design a machine B that can run this program in 5 seconds. You are allowed to increase the clock frequency to a level you wish. However, this increase would affect the rest of the CPU design, causing machine B to require 1.3 times as many clock cycles as machine A for this program. What clock rate should you target to gain the required gain in speed?
Background image of page 2
Q2 (20 pts) Write a sequence of MIPS instructions to implement the following segment of C code: sum=0; for (i=tail; i>0; i--){ sum = sum + i; } Assume that tail is originally in memory location X. Use the following register allocation in your code: Make sure you comment all the instructions. $a0=sum , $t0=i , $t1=tail ,
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Q3. (20 pts.) The following table shows a sequence of memory references given in
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: word addresses. The cache is assumed to be originally empty, and implemented as direct-mapped with 16 words, arranged in blocks of four words. Show the hits and the misses, and the valid bit. Justify your answers. What is the final cache content? Word Address hit/miss? valid bit Justification 0x00000 3 0x00011 5 0x00101 15 0x01111 11 0x01011 6 0x00110 1 0x00001 18 0x10010 22 0x10111 27 0x11100 21 0x10110 24 0x11001 12 0x01100 2 0x00010 7 0x00111 0x00000 Q4. (20 pts.) Convert 25 1-(base 10) to IEEE-754 single precision floating point format. Show your steps. Q5. (10 pts.) The instruction cache miss rate for a program is 3% and the data cache miss rate is 2%. Assuming that the miss penalty is 30 cycles for all misses, and the frequency of all memory accesses is 20%, determine how much faster a machine with a perfect cache would run. (10 pts.) Assume now that we double the clock rate. How much faster will the machine be with faster clock?...
View Full Document

This note was uploaded on 08/22/2010 for the course CDA 3101 taught by Professor Staff during the Fall '07 term at University of Central Florida.

Page1 / 6

finalexamfall05 - word addresses The cache is assumed to be...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online