

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
A computer organization homework assignment from the winter 2008 semester. The assignment includes various questions related to instruction execution time, cpu performance, and optimization. Students are required to calculate the time taken to execute a given code on a cpu with a specific clock frequency, compare the peak mips ratings of two different cpu implementations, determine the number of multiplication replacements in an optimized program, and analyze the speedup of various cpu enhancements.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!
Page 1 of 2
Show all intermediate steps clearly and legibly to obtain full credit.
Instruction Cycles add, addi, sll 3 bne 4 lw 7
Ignoring the four instructions before the loops, how many seconds will it take to execute this code in the worst case?
Class CPI 1 CPI (^2) A 1 3 B 3 3 C 4 3 D 5 4 E 6 4
a. What are the peak MIPS ratings of CPU 1 and CPU 2?
b. If the number of instructions executed in a certain program is divided equally among these instruction classes except for class A, which occurs five times as often as each of the other classes, which CPU implementation is faster for this program (i.e., CPU 1 or CPU 2 ), and by how much?
0306-550 Winter 2008 Homework Assignment #2 Page 2 of 2
a. Determine the speedup for these enhancements to the computer. i. Make multiply instructions run ten times faster. ii. Make memory access instructions run three times faster. iii. Make both enhancements i and ii.
b. Suppose you change the program so that the execution time distribution is no longer 20%, 50%, and 30%. If none of the percentages can be zero, what sort of program would result in a tie (with regard to speedup) between the two individual enhancements above? Provide both a formula and some examples.
Enhancement #1 factor = 6 Enhancement #2 factor = 4 Enhancement #3 factor = 3
For a specific application, enhancements 1, 2, 3 are useable 15%, 10%, and 5% of the resulting execution time after the enhancements were applied, respectively.
a. What is the overall speedup obtained?
b. What where the fractions of original execution time where each enhancement was applied?
b. Suppose that you could reduce the number of cycles for multiplication to 8 but that the CPU cycle time would need to be increased by 15%. Should you make this modification?