Comparing Various Scheduling Algorithms

CPU Scheduling is a process of determining which process will own CPU for execution while another process is on hold. The main task of CPU scheduling is to make sure that whenever the CPU remains idle, the OS at least select one of the processes available in the ready queue for execution. The selection process will be carried out by the CPU scheduler. It selects one of the processes in memory that are ready for execution.

Note :

1. Context Switch is not considered at start and end of processes.
2. Process ID acts as Tiebreaker.
3. By default time quantum for Round Robin is considered to be 1.

Preferences :

1. Priority : 1 is high



Algorithms :

First Come First Serve (FCFS) Shortest Job First Non-Preemptive(SJFN) Longest Job First Non-Preemptive(LJFN) Shortest Job First Preemptive (SJFP) Longest Remaining Job First Preemptive(LJFP) Round Robin Priority (Non-Preemptive) Priority (Preemptive) Highest Response Ratio Next (HRRN)