Which of the following is FALSE about SJF (Shortest Job First Scheduling)?
S1: It causes minimum average waiting time S2: It can cause starvation
(A) Only S1
(B) Only S2
(C) Both S1 and S2
(D) Neither S1 nor S2
Answer: (D)
Explanation:
- Both SJF and Shortest Remaining time first algorithms may cause starvation. Consider a situation when long process is there in ready queue and shorter processes keep coming.
- SJF is optimal in terms of average waiting time for a given set of processes, but problems with SJF is how to know/predict time of next job.
Refer Process Scheduling for more details.
Quiz of this Question
Recommended Posts:
- Operating Systems | CPU Scheduling | Question 1
- Operating Systems | CPU Scheduling | Question 2
- Operating Systems | CPU Scheduling | Question 3
- Operating Systems | CPU Scheduling | Question 4
- Operating Systems | CPU Scheduling | Question 5
- Operating Systems | CPU Scheduling | Question 7
- CPU Scheduling in Operating Systems
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Difference between Priority Scheduling and Round Robin (RR) CPU scheduling
- Difference between Priority scheduling and Shortest Job First (SJF) CPU scheduling
- Two-level scheduling in Operating Systems
- Operating Systems | Input Output Systems | Question 2
- Operating Systems | Input Output Systems | Question 5
- Operating Systems | Input Output Systems | Question 4
- Operating Systems | Input Output Systems | Question 5
- Program for FCFS CPU Scheduling | Set 1
- Program for Shortest Job First (or SJF) CPU Scheduling | Set 1 (Non- preemptive)
- Program for FCFS CPU Scheduling | Set 2 (Processes with different arrival times)
- Program for Priority CPU Scheduling | Set 1
- Program for Preemptive Priority CPU Scheduling
