Which non-preemptive scheduling algorithms suffer from starvation and under what condition.
Answers
Answered by
1
Answer:
From my remembered OS time in College, Shortest Job First is the non-preemptive algorithm that can happen to provoke starvation. How? To put it simple, if you have a very long process and short processes keep coming up, SJF will swap to the short ones and keep the long process in the waiting pipe.
Explanation:
follow me
mark as brainiest
Similar questions