The FCFS, which stands for First Come First Serve Scheduling Algorithm, is a non-preemptive scheduling algorithm, which means that if a process once starts executing in the processor, then it cannot be preempted in between the processing. Thus, the concept of priority and urgency is not ...
In FCFS scheduling the burst time of the first job is the highest among all the other jobs so this situation is referred to as a convoy effect.For example, there is one CPU intensive process (which has large burst time) in the ready queue, and many more other processes comparatively ...