Consider the process details given in the following table. Process ID – CPU Burst – Arrival Time – Priority
Consider the process details given in the following table.
Process ID – CPU Burst – Arrival Time – Priority
P0 – 3 – 0 – 1
P1 – 9 – 2 – 4
P2 – 7 – 4 – 3
P3 – 6 – 3 – 2
A new pre-emptive scheduling algorithm is proposed, i.e., the Longest Remaining Time Next (LRTN), wherein ties are broken by giving priority to the process with the highest priority. Calculate the following.
i. Turnaround time for Process P2
ii. Response time for Process P3
Show answerHide answer
Correct answer: (A) (i) 20, (ii) 6