Question
Consider the following code: lw $t0, 0 ($s0) addi $s0, $s0,4 lw $s1, 0 ($s0) addi $s0, $s0, 4 add $t0, $t0, $t1 lw $t2,
Consider the following code: lw $t0, 0 ($s0)
addi $s0, $s0,4
lw $s1, 0 ($s0)
addi $s0, $s0, 4
add $t0, $t0, $t1
lw $t2, 0 ($s0)
addi $s0, $s0,4
add $t0, $t0, $t2
a. Assuming the processor has full forwarding, populate the following pipeline diagram using compact notation (use S for stalls).
b. Assuming the processor has full forwarding and the processor an issue one load/store instruction and one ALU type instruction at a time (Static Dual Issue), populate the following pipeline diagram using compact notation (use S for stalls). Assume a stall in one instruction will also cause a stall in the dual instruction.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started