EEL 5708 – Midterm examination
Date: October 11, 2006
Name:
Student Code:
Instructions:
This exam is open book and open notes. Allotted time is 50 minutes.
Explicitly state all your assumptions.
Don’t just give answers, always try to write down the way you were thinking.
Even if you can not find a solution, write down the paths you have tried.
Problem 1 (50 points)
Consider the following assembly program written for a 32 bit MIPS machine with no
delayed branches.
li r20, 0 # load immediate
li r19, 16000
li r15, 0
start:
ld r1, 0(r20) # load into r1 from memory
add r15, r15, r1
addi r20, r20, 32 # add immediate
sub r3, r19, r20
bnez r3, start # jump to start if r3 not equal with zero
a) Write a C, C++ or Java program which corresponds to this assembly program
b) Identify the RAW, WAR and WAW conflicts in the assembly program.
c) Assume that the program is run on a machine where there is a stall of 3 cycles
between the writing and the reading of a register1. Rewrite the assembly program
by inserting NOP operations where there will be stalls.
d) Unroll the loop in the program 4 times in software (assembly). Transform the
program by register renaming such that the number of stalls is minimized.
1 That is, you need 3 NOPs (or other operations) between ADD R1,R2,R3 and ADD R6, R1,R5.
