It termed as First Come First Serve (FCFS) Scheduling. As its name implies, the process which arrives first in front of CPU for processing, then that process executed first. It is a non-preemptive scheduling algorithm which means in this priority of proc
Gantt ChartIn this example, we can see the waiting times of both phases. However, the length of the schedule is the same that is 41 units but the waiting time will be lesser in this schedule.Average waiting Time = 5+1+0/3 = 6/3 = 2How to Avoid Convoy Effect in FCFS Scheduling?