Explain Priority Scheduling

Q1. Explain Priority Scheduling.

Ans. Round robin scheduling makes the implicit assumption that all processes are equally important.

In this scheduling algorithm each process has a priority associated with it, and as each process hits the queue, it is sorted in based on its priority so that processes with higher priority are dealt with first.

It should be noted that equal priority processes are scheduled in FCFS order.

To prevent high priority processes from running indefinitely, the scheduler may decrease the priority of the currently running process at each clock tick (that is, at each clock interrupt). If this action causes its priority to drop below that of the next highest process, a process switch occurs. Alternatively, each process may be assigned a maximum time quantum that it is allowed to run. When this quantum is used up, the next highest priority process is given a chance to run.

Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: