Priority Scheduling (SJF)

• A priority number (integer) is associated with each process

• The CPU is allocated to process with the highest priority (smallest integer = highest priority

               - Preemptive 
               - Non preemptive

• SJF is a priority scheduling where priority is the predicted next CPU burst time.

• Problem = Starvation - low priority processes may never execute.

• Solution = Aging - as time progresses increase the priority of the processes.