1. Discuss the difference between fixed and dynamic, online and offline, optimal and heuristic scheduling algorithms.

2. . Show mathematically that the upper limit for CPU utilization with the rate-monotonic approach, limn n n ( ) 2 1 1 , is exactly ln 2 as stated in Equation 3.7

3. .Discuss the advantages of earliest deadline first scheduling over ratemonotonic scheduling and vice versa.

4. Explain what is meant by context-switching overhead, and how to account for it in the rate-monotonic and earliest deadline first schedulability analysis.

5.Show with an example that the earliest deadline first algorithm is no longer an optimal scheduling algorithm if preemption is not allowed.

book reference: Real-Time Systems Design and Analysis: Tools for the Practitioner by Phillip A. Laplante, Seppo J. Ovaska, IEEE Press, 4th Edition.