Concept:
In Priority Scheduling, CPU is allocated to the process having the highest priority.
Step 1: Understand the scheduling mechanism.
High-priority processes are executed before low-priority processes.
Step 2: Identify the drawback.
If high-priority jobs continue arriving, low-priority processes may never get CPU time.
They may remain waiting indefinitely.
Step 3: Name this problem.
This indefinite postponement is called
\[
\boxed{\text{Starvation}}
\]
Step 4: Common remedy.
The problem is often solved using
\[
\text{Aging}
\]
where priority gradually increases with waiting time.
Was this answer helpful?
0
0
Top TS PGECET Computer Science & Information Technology Questions