In this exercise, we examine how pipelining affects the clock cycle time of the processor. Problems in this exercise assume that individual stages of the data path have the following latencies: Also, assume that instructions executed by the processor are broken down as follows: 4.8.1 [5] What is the clock cycle time in a pipelined and non-pipelined processor?
4.8.2 [10] What is the total latency of an LW instruction in a pipelined and non-pipelined processor?
4.8.3 [10] If we can split one stage of the pipelined data path into two new stages, each with half the latency of the original stage, which stage would you split and what is the new clock cycle time of the processor?
4.8.4 [101 Assuming there are no stalls or hazards, what is the utilization of the data memory?
4.8.5 [10] Assuming there are no stalls or hazards, what is the utilization of the write-register port of the Registers unit?
4.8.6 [30] Instead of a single-cycle organization, we can use a multi-cycle organization where each instruction takes multiple cycles but one instruction finishes before another is fetched. In this organization, an instruction only goes through stages it actually needs (e. g., ST only takes 4 cycles because it does not need the WB stage). Compare clock cycle times and execution times with single cycle, multi-cycle, and pipelined organization.