Question

CS - Computer Organization. Topic: Pipelining. (If you do write your solutions by hand, please write clearly) Thank you so much.

Please pay close attention to the instructions, this is an important task, that will help me to learn the subject and finally pass the class, I will greatly appreciate the help in this regard. My question is the following:

Problenm Consider the following instructions. Complete the pipeline diagram, indicating the cycle in which each instructions stages are executed. Assume that forwarding is used to avoid stalls, when possible. Draw lines between stages to indicate forwarded values. If necessary, stalls may be indicated with an S. You will certainly need more cycles than are included below. You only need to show one run through these lines of code. Assume the branch is NOT TAKEN at the bne. This is a loop, but you don't have to go on until the program halts Cycle 12345678910 ori $s0,S0,92 lw St0, 0 (Ss0) sub St3, Ss0, $t0 addi $t0,St0,1 bne $0,$t3,LOOP sw Ss5, 16(Ss2)

Answer 1

Answer is as follows:

5-Stage Pipeline Diagram with Forwarding as given scenario is as follows:

i 2 3 4 5 6 7 8J 10 J 12 13 inst So 2. M W 5 F D M W 9ndiest Fowaudiry

From above we get 12 Cycles.

All the indications are defined in the diagram.

Forwarding paths :

Instruction 1 to Instruction 2 = S0

Instruction 2 to Instruction 3 = T0

Instruction 3 to Instruction 5 = T0

Instruction 4 to Instruction 5 = S0

Instruction 5 to Instruction 6 = T0

if there is any query please ask in comments...