Question: Given the following MIPS assembly like code: Li R 8 , 8 Time left 0 : 4 2 : 3 L: , LW R 2
Given the following MIPS assembly like code:
Li R
Time left ::
L: LW
Add R R R
Sub R RI R
w RR
Sw RR
Subi R R
BNEQZ R L
Also, given the following latencies for each stage:
IF: ns ID: ns EX: ns MEM: and WB: ns
What is the total number of stall cycles needed when running this code on a MIPS Pipelined CPU without data forwarding and the branch resolved in the EX Stage and initialized to be NoI Taken, Ignore initial pipeline fill cycles.
A
B
C
D
E
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
