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) SW $53, 0($51) ADD $54, $s3, $52 LW $53, 0($51) ADD $50, $s3, $51 LW $54, 0($s2) ADD $56, $55, $51 LW $51, 0($53) ADD $54, $53, $s2 SW $53, 0($51) LW $53, 0($51) LW $54, 0($s2) ADD $50, $s3, $S1 ADD $56, $55, $51
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
