UGC NET CSE | December 2012 | Part 2 | Question: 20

Question

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using:

• A. Parity bit
• B. Aging
• C. Compaction
• D. Timer

Comments

yes I think so why in  non preemptive scheduling starvation occurs ,,ex- firstly p0 and p1 arrive respectively  in the ready queue p1 priority higher than p0 then p1 execute first and p0 waiting for untill p1 finishes its execution suddenly p2 and p3 comes respectively into the ready queue whose priority higher than p1 then p2 and p3 executes so here  we can see p0 waiting for indefinite time so starvation occurs

---

Exactly .. (y)

---

thanks

Answer 1

A major problem with priority scheduling is indefinite blocking or starvation. A solution to the problem of indefinite blockage of the low-priority process is aging.Aging is a technique of gradually increasing the priority of processes that wait in the system for a long period of time.

 

Hence,Option(B)Aging is the correct choice.

 

Answer 2

Ans- B. Aging

Answer 3

B, Aging

aging will lead to increase in priority of low-priority jobs eventually with time.

Comments

B Aging: It is the process of increasing the priority of jobs which stays in waiting queue for a long time