Discussion
The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using :
Answer: B
Aging solves the problem of indefinite blockage (starvation) of low-priority jobs in priority scheduling. The priority of a process which has waited a long time is raised step by step, so that it finally gets the CPU.
A parity bit is for error detection, compaction is the way to remove external fragmentation by moving memory contents together, and a timer is used to interrupt a running process in time-sharing. None of these stops a low-priority job from waiting forever.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development