Question

Suppose that a scheduling algorithm (at the level of short-term CPU scheduling) favors those processes that have used the least processor time in the recent past. Why will this algorithm favor I/O-bound programs and yet not permanently starve CPU-bound programs?

Answer 1

Answer of the given question is :

I/O-bound

programs would not require much CPU usage, having short CPU bursts.

CPU-bound programs require large CPU bursts. CPU-bound processes do not

have to worry about starvation because I/O bound programs finish running

quickly allowing CPU-bound programs to use the CPU often.

Explanation:

I/O-bound

is a thread generally has a tight latency that needs a compare to computer bond thread on the windows workload.

When a mouse click then it response ASAP as compared to batch job which is running in the background.

If the outcome is slower, then the user switch the operating systems and server workload does not care about UI