Problem
Consider the following reservation
(a) What are the forbidden lateness and the initial collision vector?
(b) Draw the state transition diagram for scheduling the pipeline.
(c) Determine the MAL associated with the shortest greedy cycle.
(d) Determine the pipeline throughput corresponding to the MAL and given r.
(e) Determine the lower bound on the MAL for this pipeline. Have you obtained the optimal latency from the above state diagram?