Priority Scheduling

•  Each process has its own priority.
• Out of all available processes highest priority process gets the CPU.
• If Tie then use FCFS.
• Priority 

                             1. Static (doesn't change throughout the execution of process).

                            2. Dynamic (Changes after some interval of time).

• Version 

                                  1. Non- preemptive

                                  2. Preemptive

Starvation and Aging (In Priority Scheduling)

Starvation

Indefinite Blocking

• A Process which is ready to run can wait indefinitely because of low priority.
• High priority processes prevent a low priority proccess from ever getting the CPU.

Aging

• Method to ensure that process with lower priority will eventually complete thier execution.
• By gradually increasing the priority of processes that wait in the System for a long time.