Note: Please Only answer if can answer both a and b thank you

a. Consider two processes, P1 and P2, where p1 = 60, t1 = 30, p2 = 80, and t2 = 35.
i. Can these two processes be scheduled using rate-monotonic scheduling? Illustrate your answer using a
Gantt chart such as the ones in Figure 5.21–Figure 5.24.
ii. Illustrate the scheduling of these two processes using earliest-deadline-fist (EDF) scheduling.
b. Describe how deadlock is possible in dining philosopher problem. Mention three remedies to overcome the
problem. Give a deadlock free solution to the dining philosopher problem using any one of the remedy.

Public Answer

GPWCN8 The First Answerer