Q3. Dynamic Scheduling in Tomasulo Consider the following code fragment 1: MUL.D F2, F4, F6 2 ADD D F4, F2, F8 : ADD.D F8, F8, F10 :MUL.D F8, F12, F12 You are going to describe the execution of the code for a single-issue MIPS pipeline implemented with Tomasulo scheduling, with functional units as described in the following table: FUtype FP adder Cycles in EX # of FUs FP multiplier Also assume the following An instruction reads its operands when the instruction issues, if they come from the register file Instruction issue and write result (to CDB) stages each take clock cycle. (a) List the data dependences. Use ij format, meaning the dependence exists from the instruction labeled i to the instruction labeled j. True Anti Output: Q3. Dynamic Scheduling in Tomasulo Consider the following code fragment 1: MUL.D F2, F4, F6 2 ADD D F4, F2, F8 : ADD.D F8, F8, F10 :MUL.D F8, F12, F12 You are going to describe the execution of the code for a single-issue MIPS pipeline implemented with Tomasulo scheduling, with functional units as described in the following table: FUtype FP adder Cycles in EX # of FUs FP multiplier Also assume the following An instruction reads its operands when the instruction issues, if they come from the register file Instruction issue and write result (to CDB) stages each take clock cycle. (a) List the data dependences. Use ij format, meaning the dependence exists from the instruction labeled i to the instruction labeled j. True Anti Output