Description

Priority scheduling is a method of scheduling processes based on priority. In this method, the scheduler chooses the tasks to work as per the priority, which is different from other types of scheduling, for example, a simple round robin.

Preemptive: This type of scheduling may preempt the central processing unit (CPU) in the case the priority of the freshly arrived process being greater than those of the existing processes.

Non-preemptive: This type of scheduling algorithm simply places the new process at the top of the ready queue.

Please note that the following example showes Preemptive Priority Scheduling