Question: 2. A periodic task-set as shown in Table 3 is to be scheduled on a preemptive processor. In addition, a job J with unknown

2. A periodic task-set as shown in Table 3 is to be scheduled on a preemptive processor. In addition, a job J

2. A periodic task-set as shown in Table 3 is to be scheduled on a preemptive processor. In addition, a job J with unknown arrival time and computation time of 5 units needs to be scheduled on the processor. Task TI T2 Computation Time 1 2 A periodic task-set Period 4 5 Deadline 4 5 a) (3 points) Assume Rate Monotonic (RM) scheduling for the periodic tasks, while job J is served by a polling server with period TS = 3 and computation time CS=0.5. What is the smallest relative deadline that J can always satisfy? b) (6 points) Assume EDF scheduling for the periodic tasks, while job J is served by a total bandwidth server. What is the smallest relative deadline that J can always satisfy such that the periodic tasks are also schedulable? 2. A periodic task-set as shown in Table 3 is to be scheduled on a preemptive processor. In addition, a job J with unknown arrival time and computation time of 5 units needs to be scheduled on the processor. Task TI T2 Computation Time 1 2 A periodic task-set Period 4 5 Deadline 4 5 a) (3 points) Assume Rate Monotonic (RM) scheduling for the periodic tasks, while job J is served by a polling server with period TS = 3 and computation time CS=0.5. What is the smallest relative deadline that J can always satisfy? b) (6 points) Assume EDF scheduling for the periodic tasks, while job J is served by a total bandwidth server. What is the smallest relative deadline that J can always satisfy such that the periodic tasks are also schedulable?

Step by Step Solution

3.47 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Computer Network Questions!