Consider the following five with relative deadlines equal to periods: T1 = (2, 10), T2 = (2, 14), T3 = (3, 15), T4 = (1, 50), T5 = (3, 24). The tasks are scheduled using
the rate monotonic priority assignment
1. Consider the case when tasks share two resources: X and Y. Each task requires X for 1 time unit. Only tasks T1 and T3 require Y, and for 1 and 1.5 time units respectively. Determine the blocking times for each task. Then determine if these tasks are schedulable when scheduled rate monotonically, and with priority inheritance. You may assume that there is no nesting of critical sections.
2. With conditions remaining the same as in part (a), we would like to reduce the relative deadline for T3 to improve the quality of service. What is the shortest deadline that we can choose for task T3 such that all tasks will meet their deadlines? You need to reduce the deadline only for T3. After the deadline reduction, tasks will be scheduled using the deadline monotonic priority assignment.