GATE | GATE 2017 MOCK II | Question 53
Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Pi and Pi+1 for any i and service time of Pi is Si. If t > Si for every i then, what should be the strategy to schedule the processes ?
(B) Shortest Job First
(C) Round Robin
(D) Shortest Remaining Time First
If t>Si then all the processes are serviced in FCFS based because when the next process arrives the previous process is already completed.
Quiz of this Question