Which of the following scheduling algorithms is most prone to convoy effect, where a long-running process blocks shorter processes behind it?​

Correct option is B

The correct answer is (b) First-Come, First-Served (FCFS).

• FCFS processes in arrival order, meaning that once a long process starts, it runs to completion, blocking shorter processes that arrive later.

• The convoy effect happens when a long-running process, arriving first, delays all subsequent shorter processes, increasing their waiting times.

• FCFS lacks preemption and does not prioritize processes based on their burst time, leading to inefficiency when a long process precedes many short ones.

Information Booster:

• FCFS: The simplest scheduling algorithm that runs processes in the order they arrive, but can lead to high average waiting times if a long process is ahead of shorter ones.

• Convoy Effect: Occurs when a long-running process causes all other shorter processes to wait, increasing their average waiting time and reducing system efficiency.

• Shortest Job First (SJF): Prioritizes shorter processes, helping to minimize waiting times and avoid the convoy effect.

• Priority Scheduling (non-preemptive): Schedules processes based on priority, not necessarily arrival time, and can also lead to blocking if high-priority processes are long.

• Round Robin: Assigns fixed time slices to each process, ensuring no process monopolizes the CPU, which reduces the convoy effect.