There are three processes in the scheduling queue and assume that all three of t
ID: 3856379 • 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.
Please answer the following questions:
(a) What type of scheduler (FCFS, SJF, RR) will produce the above schedule? Explain your answer.
(b) What is the waiting time for each process?
CPU I/O CPU I/O CPU P1 P2 P3 2 2 2 4 P1 is done P2 is done 2 P3 is done 2 2Explanation / Answer
A) This is SJF(Shortest Job First) Scheduling because from the CPU Schedule Graph We can see that always the shortest CPU time process is being selected. for ex. at time t=2 we have two processes waiting that is P1 and P2 but it selects P1 because it requires only 4 CPU time than P1 because it requires 5 CPU time
B) Waiting time for each processes are below
P1 = 2
P2 = 18
P3 = 4