# Determining Pipeline Cycle Time

I'm having trouble figuring out how the longest stage of a pipeline is calculated given the following:

"Your processor has a 3-stage pipeline where the delay is 26ns through the first stage, 40ns through the second stage, and 26ns through the third stage. The propagation delay for latches is 4ns. What is the speedup, over an infinite number of instructions, of the given pipeline over an unpipelined version assuming the logic is the same for both versions?"

Is the pipeline cycle time equal to the longest stage plus two latch propagation delays or just one? I understand that there will be a latch delay before and after entering the longest stage, but I'm not sure whether to count both of the delays or just one when calculating the pipeline cycle time.

• Insufficient data. The pipeline cycle time includes the propagation delay of the latches, the largest combinatorial logic delay, and the input setup time of the next latch. Since a value for the last item is missing, the question can't be answered. Jun 9, 2014 at 22:06
• Model the overall delay through a variable number of stages and it should be clear that you go through only one latch per clock cycle (at least if your pipeline is functioning as a pipeline). Depending on nature of your inputs though, you may need to have a latch at the input forming a sort of 0-th pipeline stage. Jun 9, 2014 at 22:32
• Is this about electronic design? If this was was water pipes and valves, and the times were in tenths of a second, how would the answer differ?
– Kaz
Jun 9, 2014 at 23:04