409 views
1 votes
1 votes
If a CPU gets mostly I/O bound processes,then what is the best scheduling algorithm?
a)round robin
b)shortest recovery line
c)priority
d)Multi level feedback

2 Answers

1 votes
1 votes

Ans D) Multilevel feedback scheduling

I/O-intensive processes will end up on higher priority queues and CPU-intensive processes will end up on low priority queues.

Multilevel feedback scheduling favor I/O bound processes by letting them run often that increase the quantum at lower priority levels also favor CPU bound processes by giving them a larger chunk of CPU time when they are allowed to run.

https://www.cs.rutgers.edu/~pxk/416/notes/07-scheduling.html

edited by

No related questions found