solved Please solve/answer below questions.5 pages – APA Format – No

Please solve/answer below questions.5 pages – APA Format – No Plagiarism. [5-stage pipelined Processor & Hazards] Consider the following RISC-V code: a) Data hazards are caused by data dependences in the code. Whether a dependency causes a hazard depends on the machine implementation (i.e., number of pipeline stages). List all of the data dependences in the code above. Record the register, source instruction, and destination instruction; for example, there is a data dependency for register x1 from the ld to the addi. Or use this notation: (xn: RAW(Iy), where xn is register number like x1, x2..etc., and Iy is instruction number I1, I2 ..etc.)b) Show the timing of this instruction sequence for the 5-stage RISC pipeline without any forwarding or bypassing hardware but assuming that a register read and a write in the same clock cycle “forwards” through the register file. Use a pipeline timing chart like we did in the examples discussed in the class. Assume that the branch is handled by flushing the pipeline. If all memory references take 1 cycle, how many cycles does this loop take to execute?c) Show the timing of this instruction sequence for the 5-stage RISC pipeline with full forwarding or bypassing hardware but assuming that a register read and a write in the same clock cycle “forwards” through the register file. Use a pipeline timing chart like we did in the examples discussed in the class. Assume that the branch is handled by predicting it is not taken. If all memory references take 1 cycle, how many cycles does this loop take to execute?d) Show the timing of this instruction sequence for the 5-stage RISC pipeline with full forwarding or bypassing hardware but assuming that a register read and a write in the same clock cycle “forwards” through the register file. Use a pipeline timing chart like we did in the examples discussed in the class. Assume that the branch is handled by predicting it is taken. If all memory references take 1 cycle, how many cycles does this loop take to execute?e) High-performance processors have very deep pipelines—more than 15 stages. Imagine that you have a 10-stage pipeline in which every stage of the 5-stage pipeline has been split in two. The only catch is that, for data forwarding, data are forwarded from the end of a pair of stages to the beginning of the two stages where they are needed. For example, data are forwarded from the output of the second execute stage to the input of the first execute stage, still causing a 1-cycle delay. Show the timing of this instruction sequence for the 10-stage RISC pipeline with full forwarding and bypassing hardware. Use a pipeline timing chart like that we did in the examples discussed in the class (but with stages labeled IF1, IF2, ID1, etc.). Assume that the branch is handled by predicting it as taken. If all memory references take 1 cycle, how many cycles does this loop take to execute?f) Assume that in the 5-stage pipeline, the longest stage requires 0.8 ns, and the pipeline register delay is 0.1 ns. What is the clock cycle time of the 5-stage pipeline? If the 10-stage pipeline splits all stages in half, what is the cycle time of the 10-stage machine?g) Using your answers from parts (d) and (e), determine the cycles per instruction (CPI) for the loop on a 5-stage pipeline and a 10-stage pipeline. Make sure you count only from when the first instruction reaches the write-back stage to the end. Do not count the start-up of the first instruction. Using the clock cycle time calculated in part (f), calculate the average instruction execute time for each machine.