Process Scheduling Workbench
Priority Scheduling Algorithm


When more than one process is runnable, the Operating system must decide which one to run first. The part of the Operating system concerned with this decision is called the Scheduler , and the algorithm is called the scheduling algorithm.

In the Priority Scheduling each process is assigned a priority, and the runnable process with the highest priority is allowed to run.

This workbench displays a Priority Scheduler which can have a maximum of four processes of each priority and a total of twelve processes. It has three queues for different priority processes. A scrollbar is provided to select the priority of the process to be created. As lomg as there are runnable processes in the highest priority queue, it just runs each one for a specific unit of time in the round robin fashion. If the highest priority class is empty it runs the next highest priority processes. A new process is created using the Create button and a process is submitted to CPU using the Submit button. This can be viewed in a continuous mode by clicking the Animate button. The priority class can be changed during the animation. The Clear button clears the screen brings the applet to the initial state. The speed of animation can be changed using the Scroll Bar. The status of the scheduler is displayed in the textfield provided at the top.

The graph shows the Process Turn Around Time i.e the total amount of time taken by each process for completion including the time it has waited in the queue. The performance meter shows the CPU load i.e the the total CPU time required by all processes in all the priority queues at any given time.

Workbench