Consider the following 9-stage pipeline with 2 stages to fet…

Consider the following 9-stage pipeline with 2 stages to fetch the instruction and 3 stages to execute an instruction. Registers are validated and read in RR and written to in WB. Given that there is no data forwarding, how many bubbles would be introduced if two adjacent instructions (0 instructions between them) have a RAW dependency?

Consider the following code snippet. I1: $s2 ← MEM[$a1 + 1]I…

Consider the following code snippet. I1: $s2 ← MEM[$a1 + 1]I2: $v0 ← $s2 + 5I3: $a1 ← $v0 + $s2I4: $v1 ← $v0 + $v0 In an ideal execution flow, each instruction stays in the RR stage for a single cycle. Indicate for how many additional cycles each of the following instructions stalls at the RR stage (pushing a bubble forward), due to data hazards: I2:[i2] I3:[i3] I4:[i4]

Consider the classic 5-stage pipeline for LC-5200 as describ…

Consider the classic 5-stage pipeline for LC-5200 as described in the textbook without any hardware branch prediction mechanisms. The outcome of the branch instruction (e.g., beq) is not resolved until the Execute (EX) stage. Give one reason why the decision on whether or not to branch should not be resolved in the Fetch (IF) stage. Give your answer in under 50 words.

Sean decides to modify this pipeline by combining the EX and…

Sean decides to modify this pipeline by combining the EX and MEM stages. The new per stage delay will be the sum of the per stage delays of the 2 combined stages. What will the pipeline’s new frequency be in MHz? Give your answer as a whole number in MHz without units.