Starvation or indefinite blocking is the biggest problem with which algorithm
Answers
Answered by
2
Answer:
Deadlock
Explanation:
Answered by
0
ANSWER: Priority scheduling algorithm .
EXPLANATION:- 1. Starvation typically happens when the shortest job is scheduled first or when priority scheduling is used.
2. In the priority scheduling technique, we give each process a priority rating, and the CPU is then allotted and the process is run accordingly.
3. The process with the highest priority will be given the CPU in this situation. The highest priority activity will receive the CPU even if the burst time is brief.
4. A process in an operating system suffers greatly from starvation, but with the aid of ageing, we can solve this problem.
5. A problem with the Priority scheduling methods is starvation or endless blocking. Despite being in the ready condition, a low priority procedure continues.
EXPLANATION:- 1. Starvation typically happens when the shortest job is scheduled first or when priority scheduling is used.
2. In the priority scheduling technique, we give each process a priority rating, and the CPU is then allotted and the process is run accordingly.
3. The process with the highest priority will be given the CPU in this situation. The highest priority activity will receive the CPU even if the burst time is brief.
4. A process in an operating system suffers greatly from starvation, but with the aid of ageing, we can solve this problem.
5. A problem with the Priority scheduling methods is starvation or endless blocking. Despite being in the ready condition, a low priority procedure continues.
Similar questions