In estimating the performance of the single cycle MIPS implementation, we assume
ID: 440735 • Letter: I
Question
Explanation / Answer
In a single cycle MIPS Implementation, Cycle time is taken as the time taken for the longest instruction to execute. So , in general , (i.e, if all the adders have same delays) the instruction "lw"(load word) takes longest time compared to all other instructions. Time for lw= time(memory fetch) + time(register read) + time(ALU operation) + time(Data access) + time(register write) = 200+100+200+300+100 = 900 ps (Here PC+4 is done during the Data Access and register write )So above time is true if time(Data access)+time(register write) >time(adder for PC+4) (i.e, 300+100 >X) So in case a) X=300 < 400 so cycle time = 900ps b) X=500 >400 so cycle time = 900-400+500 =1000 ps c) In this case branch instruction becomes longest because of time(branch address computation) is far greater than time(Data access)+time(register write) time(branch instruction) = time(memory fetch) + time(register read) + time(ALU operation) +time(branch address calculation) = 200+100+200+800 = 1300ps. so cycle time in case c) is 1300ps.Related Questions
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.