Answer Happy

In pipelined processor implementation style. Assume we have separate instruction data memories and assume each step in the instruction execution requires 20 ps (example instruction fetching time). If no strategies are used to solve the hazard (no forwarding used, no code reordering used). What is the time required in ps to execute the following code? addi $t1,$50,6 andi $t2,$t1,3 ori $t3, $50,5 220 Future

{ 16 son Assure the register Ss1) contains (0x12345678) Write at most two instructions to move ONLY the fourth byte value in the register (Ss1) into the data memory at address stored in o) Het intis problem the fourth byte value in the register (551) = "0x12 2 I X 60 10 DOS0- 300 g Write the missed instruction in line (1) to push the contents of registers S50. Ss1. Ss2 $s3 and Ss4 in the stad 1 3 2 sw $50, 16(Ssp) 3. Sw Ss1. 12/5sp) 23/