Which of the following scheduling algorithms may cause starvation ?
so option 2--- c,d,e
As the Shortest remaining time first scheduling is a preemptive version of shortest job scheduling. It may cause starvation as shorter processes may keep coming and a long CPU burst process never gets CPU.
from wiki:- Like shortest job first, it has the potential for process starvation; long processes may be held off indefinitely if short processes are continually added. This threat can be minimal when process times follow a heavy-tailed distribution.[1] A similar algorithm which avoids starvation at the cost of higher tracking overhead is Highest response ratio next.
Starvation is the name given to the indefinite postponement of a process because it requires some resource before it can run, but the resource, though available for allocation, is never allocated to this process. 1. Priority: A process ready to run for CPU can wait indefinitely because of low priority. 2. Shortest process next : longest process possibility to get starvation. 3. Shortest remaining time first: longest process possibility to get starvation. Solution: Aging FCFS and Round Robin scheduling never happen indefinite blocking.
ANS B
64.3k questions
77.9k answers
244k comments
80.0k users