contestada

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?

Respuesta :

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.

jayilych4real

The reason why the algorithm would favor I/O-bound programs and yet not permanently starve CPU-bound programs is:

  • The I/O bound programs makes use of the system resources for a short period and after a short while, the CPU can be assessed by the CPU bound programs.

The CPU scheduling has to do with the allocation of system resources to the various processes which needs their resources. Some of these CPU scheduling algorithms includes:

  • First come, first served
  • Shortest job first (SJF)
  • Priority Scheduling, etc.

With this in mind, we can see that when these system resources are in use by I/O bound programs, then they do not take much time because their requests are short and this makes sure that the CPU-bound programs do not get permanently starved.

Read more about CPU scheduling here:

https://brainly.com/question/19999569

Otras preguntas