Why process scheduling algorithm favour i/o bound processes, Computer Engineering

Assignment Help:

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes, but not starve CPU-bound processes?

Ans: This will favor the I/O-bound programs due to the relatively short CPU burst request through them; though, the CPU-bound programs will not starve since I/O- bound programs will relinquish the CPU relatively frequently to do their I/O.

Related Discussions:- Why process scheduling algorithm favour i/o bound processes

State about movable joystick, State about movable joystick In another t...

State about movable joystick In another type of movable joystick, the stick is used to activate switches that cause the screen cursor to move at a constant rate in the selected

When the get cursor command used in interactive lists, When the get cursor ...

When the get cursor command used in interactive lists? If the hidden information is not enough to uniquely recognize the selected line, the command GET CURSOR is used. The GET

In 8085 which is called as high order / low order register, Flag is known a...

Flag is known as Low order register & Accumulator is known as High order Register.

What are the touch panels, What are the Touch Panels In case of touch p...

What are the Touch Panels In case of touch panels, displayed objects or screen positions is allowed to be selected with the touch of a finger. A typical application of touch pa

What is a shift register, What is a Shift Register? Ans: Shift R...

What is a Shift Register? Ans: Shift Register: A register wherein data finds shifted towards left or right while clock pulses are applied is termed as a Shift Register.

Which is not a layer of input-output management module, Which is not a laye...

Which is not a layer of IO management module? Ans. MCS that is Management Control System, is not a layer of IO management module.

Write a pseudo code to find sum of two functions, Q. Write a pseudo code to...

Q. Write a pseudo code to find sum of two functions? Let's write a pseudo code to find sum of two functions f(A) + f(B). In first algorithm we will not use locking. Process

Sigmoid units, Sigmoid units: Always remember that the function inside...

Sigmoid units: Always remember that the function inside units take as input the weighted sum, S and of the values coming from the units connected to it. However the function i

What is incidence matrix, Incidence Matrix: - This is the incidence matrix ...

Incidence Matrix: - This is the incidence matrix for an undirected group. For directed graphs, the vertex from where an edge is originating will have +1 and the vertex where the ed

Disc shapes and diameters - computer architecture, Disc shapes and diameter...

Disc shapes and diameters: A Mini-CD is 8 centimeters in diameter. The digital data on a CD start at the center of the disc and proceeds toward the edge, whi

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages