Question: How much time the following code sequence takes when executed without forwarding and with forwarding? Can you reorder the code to avoid all stallstif yes,

How much time the following code sequence takes when executed without forwarding and with forwarding? Can you reorder the code to avoid all stallstif yes, please reorder the code and execute the code with forwarding while providing the time it takes. Assume that each clock cycle takes 100 pico sec. Ibu rl, () sub r7, r1, 12 ab ri, 047) and r10 r11, rii sit 17. rr7 Execution without forwarding takes cydes. Execution without forwarding the Ds. Erection with forwarding takes cydes.) ) .3 Execution with forwarding 1 - cret Ciel buri, 0(27) 7. 1. 2 ) .cycles Execution without forwarding takes ) .6 Execution without forwarding takes ) cycYes Execution with forwarding takes ) .ps Execution with forwarding takes 1 5 Reordered Code (r1 , 0 ( r 1b sub r3, ra, r2 ab r1 , 0(r) and r10, r11 =11 Bit r7, rl, r7 ) * ) # Execution with code scheduling treordering) and with forwarding takes Execution with code scheduling treordering) and with forwarding takes
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
