Different Types of Non Preemptive CPU Scheduling Algorithms
First Come, First Serve (FCFS) Scheduling Algorithm
The First Come, First Serve (FCFS) scheduling algorithm is the simplest form of non-preemptive scheduling. It operates by allocating the CPU to the first process that arrives and stays in the ready queue until its completion. However, FCFS can suffer from the “convoy effect” when a long process holds up the execution of subsequent shorter processes.
Shortest Job Next (SJN) Scheduling Algorithm
The Shortest Job Next (SJN) scheduling algorithm aims to minimize the average waiting time by prioritizing processes based on their burst time. The process with the shortest burst time gets the CPU first, ensuring faster execution for shorter tasks. This algorithm is ideal for scenarios where the length of the tasks is known in advance.
