Discussion
Which CPU scheduling algorithm is most likely to cause 'Starvation' for long-running processes ?
Answer: A
Starvation is most likely under Shortest Job First (SJF) - non preemptive.
SJF always runs the shortest waiting job next. If short jobs keep arriving, a long job can wait indefinitely, because there is always a shorter job ahead of it. That indefinite postponement is starvation; ageing, which raises a job's priority the longer it waits, is the usual remedy.
Round robin gives every process a time slice in turn, and FCFS serves processes in arrival order, so neither starves anyone. Multilevel feedback queues can starve low-priority processes too, but they normally include ageing, so SJF is the standard answer.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development