Here in this section of Operating System Long Questions and Answers,We have listed out some of the important Long Questions with Answers on Non Preemptive Priority scheduling algorithms which will help students to answer it correctly in their University Written Exam.

Lists of Long Descriptive type Questions that may be asked in Written Exams.

• (1) Explain Non Preemptive Priority scheduling algorithms with illustration.

### Question-1  Explain Non Preemptive Priority scheduling algorithms with illustration.

Selection Criteria:

The process, that has highest priority, is served first.

Decision Mode :

Non Preemptive: Once a process is selected, it runs until it blocks for an I/O or some event, or it terminates

Implementation:

This strategy can be implemented by using sorted FIFO queue. All processes in a queue are sorted based on their priority with highest priority process at front end. When CPU becomes free, a process from the first position in a queue is selected to run.

Example:

Consider the following set of four processes. Their arrival time, total time required completing the execution and priorities are given in following table. Consider all time values in millisecond and small values for priority means higher priority of a process.

 Process Arrival Time (T0) Time required for completion (∆T) Priority P0 0 10 5 P1 1 6 4 P2 3 2 2 P3 5 4 0

Here, process priorities are in this order: P3 > P2 > P1 > P0.

Gantt Chart:

 P0 P3 P2 P1 0 10 14 16 22

Initially only process P0 is present and it is allowed to run. But, when P0 completes, all other processes are present. So, process with highest priority P3 is selected and allowed to run till it completes. This procedure is repeated till all processes complete their execution

Statistics:

 Process Arrival Time(T0) CPU Burst Time(∆T) Finish Time(T1) Turnaround Time(TAT=T1-T0) Waiting Time (WT=TAT-∆T) P0 0 10 10 10 0 P1 1 6 22 21 15 P2 3 2 16 13 11 P3 5 4 14 9 5

Average Turnaround Time: (10+21+13+9) / 4 = 53 / 4 = 13.25 ms

Average Waiting Time: (0+15+11+5) / 4 = 31 / 4 = 7.75 ms