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

By Mandeep Kumar|Updated : September 27th, 2022

(a) Dirty bit

(b) Compaction

(c) Aging

(d) Swapping

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithms can be solved by aging. The step-by-step process to increase the priority of processes that wait for a long time in a system.

Indefinite Blockage of Low-Priority Jobs in General Priority Scheduling Algorithm

  • Each process in the priority scheduling method has a priority assigned to it, and the process with the greatest priority receives the most CPU resources.
  • Preemptive or non-preemptive prioritisation scheduling options are available. The priority scheduling algorithm's endless blocking or hunger is a significant issue. Some low priority processes may be kept waiting forever by this approach.
  • Aging is the answer to the famine issue. The process of ageing involves gradually raising the importance of long-running operations in the system.
  • As an illustration, if priorities range from 100 to 0 (high), we could raise a waiting process' priority by 1 every 15 minutes. As a result, even a process with a priority of 100 would be given top priority.

Summary:

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using (a) Dirty bit (b) Compaction (c) Aging (d) Swapping

Aging can be used to overcome the issue of low-priority jobs being blocked indefinitely by the general priority scheduling algorithm. Indefinite blockage is related to the priority scheduling algorithm, in which a process ready for CPU can wait indefinitely due to low priority.

Comments

write a comment

CDS & Defence Exams

CDSCAPFAFCATTA ExamACC ExamOther ExamsPracticePreparation

Follow us for latest updates