# Question: This problem demonstrates that although Equation 10 2 for rate monotonic

This problem demonstrates that although Equation (10.2) for rate monotonic scheduling is a sufficient condition for successful scheduling, it is not a necessary condition (i.e., sometimes successful scheduling is possible even if Equation (10.2) is not satisfied).

a. Consider a task set with the following independent periodic tasks:

• Task P1:C1 = 20; T1 = 100

• Task P2:C2 = 30; T2 = 145

Can these tasks be successfully scheduled using rate monotonic scheduling?

b. Now add the following task to the set:

• Task P3:C3 = 68; T3 = 150

Is Equation (10.2) satisfied?

c. Suppose that the first instance of the preceding three tasks arrives at time.

Assume that the first deadline for each task is the following:

D1 = 100; D2 = 145; D3 = 150

Using rate monotonic scheduling, will all three deadlines be met? What about deadlines for future repetitions of each task?

a. Consider a task set with the following independent periodic tasks:

• Task P1:C1 = 20; T1 = 100

• Task P2:C2 = 30; T2 = 145

Can these tasks be successfully scheduled using rate monotonic scheduling?

b. Now add the following task to the set:

• Task P3:C3 = 68; T3 = 150

Is Equation (10.2) satisfied?

c. Suppose that the first instance of the preceding three tasks arrives at time.

Assume that the first deadline for each task is the following:

D1 = 100; D2 = 145; D3 = 150

Using rate monotonic scheduling, will all three deadlines be met? What about deadlines for future repetitions of each task?

**View Solution:**## Answer to relevant Questions

Draw a diagram similar to that of Figure that shows the sequence events for this same example using priority ceiling. Briefly define the seven RAID levels. Consider the disk system described in Problem 11.7, and assume that the disk rotates at 360 rpm. A processor reads one sector from the disk using interrupt-driven I/O, with one interrupt per byte. If it takes 2.5 μs to ...List and briefly define three file allocation methods. Consider the organization of a UNIX file as represented by the inode. Assume that there are 12 direct block pointers, and a singly, doubly, and triply indirect pointer in each inode. Further, assume that the system block ...Post your question