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 datapath have the following latencies: IF ID EX MEM WB 270 ps 150 ps 240 ps 290 ps 180 ps Also, assume that instructions executed by the processor are broken down as follows: alu beq lw sw 40% 15% 35% 10% 3.0.1 What is the clock cycle time in a pipelined and non-pipelined processor? 3.0.2 Assuming there are no stalls or hazards, what is the utilization of the data memory? 3.0.3 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 instruction 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.
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 datapath have the following latencies:
IF |
ID |
EX |
MEM |
WB |
270 ps |
150 ps |
240 ps |
290 ps |
180 ps |
Also, assume that instructions executed by the processor are broken down as follows:
alu |
beq |
lw |
sw |
40% |
15% |
35% |
10% |
3.0.1 What is the clock cycle time in a pipelined and non-pipelined processor?
3.0.2 Assuming there are no stalls or hazards, what is the utilization of the data memory?
3.0.3 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 instruction 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.
Step by step
Solved in 5 steps