An I/O-bound program is one that, if run alone, would spend more time waiting for I/O than

Question:

An I/O-bound program is one that, if run alone, would spend more time waiting for I/O than using the processor. A processor-bound program is the opposite. Suppose a short-term scheduling algorithm favors those programs that have used little processor time in the recent past. Explain why this algorithm favors I/O-bound programs and yet does not permanently deny processor time to processor-bound programs.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: