Suppose that a CPU scheduling algorithm favors those processes that have used the least processor time in the recent past. Why w

Question

UNO [17]

3 years ago

15

Suppose that a CPU scheduling algorithm favors those processes that have used the least processor time in the recent past. Why w

ill this algorithm favor I/O-bound programs and yet not permanently starve CPU-bound programs?

Computers and Technology

1 answer:

avanturin [10] · Answer 1 · 2022-02-13T10:49:09+03:00

Answer:

I/O bound programs will be favored due to the CPU burst request of the I/O programs. This is because their CPU burst request is short and would release the CPU within a short period.

Due to the brief request time of the I/O programs on the CPU, CPU-bound programs will not be permanently starved. After a little while, CPU resources will be released to the CPU-bound programs for use.