Explain with the help of an example which of the following scheduling algorithm could result in starvation.

a. First come first serve basis. b. Shortest Job first c. Round vobin d. Priority

1 Answer

The answer is b. If a process with shorter burst-time is present in the queue, the CPU has to execute that particular process before moving on to other processes with larger Burst time. This may create a problem for processes with larger Burst time because a new process might come up when these processes are just about to go inside the Running State.

Option d might seem a possible answer but Processes with same priorities are executed on a First-come first-serve basis which might solve the problem of starvation. Also, we can use Multi-level Feedback queues to solve the problem of Priority Scheduling.

Note: Burst-Time is the actual time a Process requires to finish execution.

Please log in to add an answer.