Non Preemptive Priority Scheduling (PS)

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

Example & Simulation

Problem

Process Arrival Burst Priority
P1 0 5 1
P2 1 3 2
P3 2 8 1
P4 3 6 3
Run Simulation
Process Arrival Burst Priority
P1 8 1 0
P2 5 1 1
P3 2 7 2
P4 4 3 3
P5 2 8 4
P6 4 2 5
P7 3 5 6
Run Simulation
PROCESS
Process Arrival Burst Priority
P1
Add Row
Run Simulation

0

Process Remaining Waiting Turnaround Priority Status
Print Result

Process Waiting Turnaround