Computer Science, asked by xudip32, 10 months ago

Which non-preemptive scheduling algorithms suffer from starvation and under what condition.

Answers

Answered by anshika28204

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

Previous Question

Next Question

Similar questions

Math, 5 months ago

Define parallel lines.

History, 5 months ago

2. The local self-government body at the village level is known as ge of a block samiti is known as the Block deve 3. All the measures that the gram panchayat plans to implement are discussed in Vyoyaponebyl the 4. The head of u...

Math, 5 months ago

13. The co-ordinates of one end of a focal chord of the parabola. y' = 8x is (2ť, 4t). Prove that the co-ordinates of the other end must be(2/t^2,-4/t)...