Question

1. Define two periodic processes P1 = (3,6,6) and P2 = (2,4,4) where (x,y,z) refers to (compute time, deadline, period). Suppose they have fixed scheduling priorities p1 and p2 respectively. Assume non-preemptive scheduling. (a) Is there a feasible schedule when p1 > p2. Your schedule should cover 18 time units. (b) Repeat using p1 < p2.

2. Assume two periodic processes P1 = (15,30,30) and P2 = (20,50,50). (a) Assume the round robin scheduling policy with one unit time intervals. Show the schedule for these processes. (b) Is there a feasible schedule using the rate monotonic method. Your schedule should cover 100 time units.

3. Using Rate Monotonic Scheduling, determine if the following task set is schedulable (may require use of utilization bound test, the response time test and/or completion time test).

Task	Execution time	Period
1	3	10
2	4	16
3	3	12
4	2	20

4. Using Rate Monotonic Scheduling, determine if the following task set is schedulable (may require use of utilization bound test, the response time test and/or completion time test).

Task	Execution time	Period
1	20	100
2	30	150
3	90	200

This is software engineering

Answer 1