Discussion
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Answer: A
The algorithm is Shortest remaining time first.
Shortest-job-first is provably optimal for minimizing average waiting time: running shorter jobs first means fewer processes wait behind each long one. All processes here arrive together, so shortest remaining time first behaves exactly like SJF and achieves that optimum.
Round-robin with a small quantum interleaves everything, so every process waits through slices of all the others. A uniform random order is optimal only by chance. Priority proportional to burst length runs the longest jobs first, the worst possible order for average waiting time.
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