The traditional UNIX scheduler is a priority-based round robin scheduler (also called a
multi-level round robin schduler). How does the scheduler go about favouring I/O bound jobs
over long-running CPU-bound jobs?
Answer:
-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.
Share To Friends Via:
Define the word operating system. 
