The traditional UNIX scheduler is a priority-based round robin scheduler (also called a multi-level round robin scheduler). How does the scheduler go about favouring I/O bound...

      

The traditional UNIX scheduler is a priority-based round robin scheduler (also called a
multi-level round robin scheduler). How does the scheduler go about favouring I/O bound jobs
over long-running CPU-bound jobs?

  

Answers


Faith
The traditional UNIX scheduler assigns each process a priority and places them in multiple ready
queues. Priorities increase over time to prevent saturation of low priority processes, boosted based on
the amount (as in lack thereof) of CPU time consumed. I/O bound jobs are favoured, naturally, as they
consume very little CPU time.
Titany answered the question on April 26, 2022 at 13:38


Next: Describe round robin scheduling. What is the parameter associated with the scheduler? What is the issue in choosing the parameter?
Previous: In a real-time system with a periodic task set,, how are priorities assigned to each of the periodic tasks?

View More Operating Systems Questions and Answers | Return to Questions Index


Exams With Marking Schemes

Related Questions