Priority Scheduling

In this topic, you will learn about, Priority Scheduling.

Priority Scheduling: This is a special kind of scheduling algorithm in which a priority is associated with each process and the CPU is allocated to the process with the highest priority. Equal priority process is scheduled in FCFS order. Priorities are generally some fixed range of numbers such as 0 to 4095. However, there is no general agreement on whether 0 is the highest or lowest priority.

Using priority scheduling we can schedule the following process as follows:
Process                    Burst Time                           Priority
P1                               10                                      3
P2                                1                                       1
P3                                2                                       3
P4                                1                                       4
P5                                5                                       2

See also  Relationship between various components of computer system