We wish to determine the execution time for a given program using the various pipelining schemes discussed in Section 13.5. Let
N = number of executed instructions
D = number of memory accesses
J = number of jump instructions
For the simple sequential scheme (Figure 13.6a), the execution time is stages. Derive formulas for two-stage, three-stage, and four-stage pipelining.