suppose that a process scheduling algorithm


Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes, but not starve CPU-bound processes?

Ans: This will favor the I/O-bound programs due to the relatively short CPU burst request through them; though, the CPU-bound programs will not starve since I/O- bound programs will relinquish the CPU relatively frequently to do their I/O.

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: suppose that a process scheduling algorithm
Reference No:- TGS0277304

Expected delivery within 24 Hours