3. Consider a simple in-order processor with the following characteristics:

An instruction can issue if all of its dependencies are satisfied

Consists of a pipeline where one instruction is issued at each cycle if possible.

There is no limit to the number of functional units.

Given the following sequential list of instructions and instruction latencies:

A. load $r2 = 4[$r1]

B. sub $r2 = $r2, $r5

C. store 8[$r1] = $r2

D. add $r1 = $r1, 4

E. store 4[$r6] = $r1

In the code snippet above, offset[register] is a type of memory addressing mode. The address is

computed as the sum of the offset and the value present in the register.

Instruction Latency

add 2

sub 2

load 3

store 4

I. What is the CPI for the sequential code execution? CPI is defined as the ratio of total number of cycles taken for execution to the number of instructions executed.

II. Say we add register renaming to the processor, can the CPI be improved through scheduling instructions differently? If so, explain how and show the new schedule and

the improved CPI value. (Note: Be careful about memory).