There are three processes in the scheduling queue and assume that all three of t
ID: 3828517 • Letter: T
Question
There are three processes in the scheduling queue and assume that all three of them are ready to run. Assume that P1 arrived a little before P2; and P2 arrived a little before P3. Scheduling starts at time t = 0. The CPU and I/O burst patterns of the three processes are as shown below: Each process exits the system once its CPU and I/O bursts as shown above are complete. You are given the following schedule. What type of scheduler (FCFS, SJF, SRTE, RR) will produce the above schedule? Explain your answer.Explanation / Answer
SRTF(Shortest Remaining Time First) CPU scheduling algorithm is used here.
The process P3 is allocated CPU first as its CPU burst is smallest ie 2, then P1 (cpu burst = 4) , then again P3 is allocated CPU not P2 as P3 is having smaller next CPU burst ie 2 as compared to P2 (cpu burst = 5) and so on