Question: Task 1 The Unix scheduler works according to the algorithm: + Prisei Tcpo (1= cruli-1) Tom (1) Pli) = Pbare + 2 2 P Priority

Task 1 The Unix scheduler works according to the algorithm: + Prisei Tcpo (1= "cruli-1) Tom (1) Pli) = Pbare + 2 2 P Priority (lower values mean higher priority) Poase Basic priority (determined by the system) P. Nice-Level (can be customized by the user) TCPU used CPU time i Scheduling interval Given are 3 processes with the initial priorities P1 = 40, P2 = 40 and P3 = 50. The timer cycle is f= 100Hz, the recalculation of priorities is done every second. Complete the table below: Time Process P1-40 Process P2=40 Process P3=50 State Topu State P Topu State P Tcpu O running 40 0...100 ready O ready 50 P 40 0 1 2 3 4 5 6 8 9 10 11 12
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
