Question: Some CPU scheduling algorithms possess the problem of starvation ( a process may never get scheduled on the CPU ) . Please discuss whether the

Some CPU scheduling algorithms possess the problem of starvation (a process may never get scheduled on the CPU). Please discuss whether the following two scheduling algorithms possess the starvation problem respectively.
(a) FCFS (first come first serve) scheduling
(b) SJF (shorted job first) scheduling

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!