Assume a computer uses pipelining of 9 stages. Each stage demands 3 clock cycles to finish its task. How many clock cycles are need to execute 11 independent instructions?

Explanation:

b) Each stage requires one clock cycle; ... Calculate how many clock cycles will take execution of this segment on the regular (non- pipelined) ... Instruction. Clock cycle number . 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 ... It is possible ... It means that all stages of 5-stage pipeline are always busy (no stalls) during the task.