Question 2 Assume you have a machine that has the following

Question #2. Assume you have a machine that has the following resources and executes Tomasulos algorithm. Clock Cycles Res Unit in Execution Stage Stations 2 ALU1 2 MULTIPLIER 10 LOAD1

Solution

The worst case scenario will always take at least as long as the other scenarios e.g. worst case scenario takes at least as long as the best case scenario, and at least as long as the average case scenario.

Suppose we have an upper bound on the running times for our worst case scenario. There is no possible way for us to find a running time for any scenario (best case, average case, worst case,etc.) that exceeds that upper bound. Thus the upperbound on the running times for our worst case