Process Scheduling

It is the simplest algorithm to implement. The process with the minimal arrival time will get the CPU first. The lesser the arrival time, the sooner will the process gets the CPU. It is the non-preemptive type of scheduling.

In the Round Robin scheduling algorithm, the OS defines a time quantum (slice). All the processes will get executed in the cyclic way. Each of the process will get the CPU for a small amount of time (called time quantum) and then get back to the ready queue to wait for its next turn. It is a preemptive type of scheduling.

It is the preemptive form of SJF. In this algorithm, the OS schedules the Job according to the remaining time of the execution.

It is the preemptive form of LJF. In this algorithm, the OS schedules the Job according to the remaining time of the execution.

The job with the shortest burst time will get the CPU first. The lesser the burst time, the sooner will the process get the CPU. It is the non-preemptive type of scheduling.

The job with the longest burst time will get the CPU first. The higher the burst time, the sooner will the process get the CPU. It is the non-preemptive type of scheduling.

In this algorithm, the priority will be assigned to each of the processes. The higher the priority, the sooner will the process get the CPU. If the priority of the two processes is same then they will be scheduled according to their arrival time.It is the non-preemptive type of scheduling.

In this algorithm, the priority will be assigned to each of the processes. The higher the priority, the sooner will the process get the CPU. If the priority of the two processes is same then they will be scheduled according to their arrival time.It is the preemptive type of scheduling.