What is the minimum number of cycles needed to completely ex

What is the minimum number of cycles needed to completely execute n instructions on a CPU with a k stage pipeline? Justify your formula.

Solution

The total cylces for n istructions on a k stage pipeline is k+(n-1).

As we have k stage stage pipeline. For the first instruction we take k cycles and for the next n-1 instructions we take only n-1 cycles. So the total clock cycles will be k+(n-1).