Question: Rewrite the following code to minimize performance on this datapath that is, reorder the instructions so that this sequence takes the most clock cycles to
Rewrite the following code to minimize performance on this datapath that is, reorder the instructions so that this sequence takes the most clock cycles to execute while still obtaining the same result:
lw $3, 0($5)
lw $4, 4($5)
add $7, $7, $3
add $8, $8, $4
add $10, $7, $8
sw $6, 0($5)
beq $10, $11, loop
** Please give detailed explanation **
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
