Comparative Study of Scheduling Algorithms in Operating System

Scheduling Algorithms deals with the problem and decides which process should be executed next and allocate to the CPU. We have various process scheduling algorithm like First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling Algorithm, Round Robin Scheduling Algorithm, Multilevel Queue Scheduling, Multilevel Feedback Queue Scheduling. First come first serve scheduling algorithm is based on FIFO.? It is suitable for batch system and is non preemptive in nature. Shortest job first scheduling algorithm is deal with both preemptive and non preemptive scheduling. Priority scheduling is necessarily a form of preemptive scheduling where priority is based upon preemption. The Round robin scheduling algorithm is used to support the time sharing process and it is also suitable for interactive system. In Multilevel queue scheduling the processes are permanently assigned to a queue on entry to the system .Multilevel feedback queue deals with those processes that move between queues.