Ask Question
29 May, 05:22

Suppose that a CPU scheduling algorithm 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?

+4
Answers (1)
  1. 29 May, 09:20
    0
    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.
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “Suppose that a CPU scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this ...” in 📙 Computers & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers