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 Vasu_gate2017 asked Nov 29, 2016 Vasu_gate2017 409 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Madhav answered Dec 15, 2016 edited Dec 15, 2016 by Madhav Madhav comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes It is multilevel feedback queue so D is correct answer refer:http://pages.cs.wisc.edu/~remzi/OSTEP/cpu-sched-mlfq.pdf Aboveallplayer answered Nov 29, 2016 Aboveallplayer comment Share Follow See all 0 reply Please log in or register to add a comment.