Question: Given the below MIPS program running on a 5 stage pipeline processor with forwarding. Reorder the below program to reduce the number of stalls to

Given the below MIPS program running on a 5 stage pipeline processor with forwarding. Reorder the below program to reduce the number of stalls to a minimum. LW $51, 0($s3) LW $s3, 0($51) ADD $55, $s3, $54 LW $54, O($50) ADD $50, $54, $s1 ADD $s2. $55, $51 ADD $56, $s3, $S1 LW $81, 0($53) LW $53, 0($51) ADD $s2, $55, $51 ADD $53, $54, $51 LW $54, 0($sp) ADD $56, $s3, $51 ADD $50, $54, $51
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
