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

Binary, 8:1 Mux for a given function, f=S (0, 1,5,7,9, 13)..

8:1 Mux for a given function, f=S (0, 1,5,7,9, 13)..

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.

Risk detection, what is meant by risk detection in software project managem...

what is meant by risk detection in software project management

Colour - elements of composition, Colour The use of colour is consider...

Colour The use of colour is considered by many to be one of the most important areas in composition. Colours can be used in isolation or specific combinations to create partic

What are the four necessary condition of deadlock prevention, What are the ...

What are the four necessary conditions of deadlock prevention? Four essential conditions for deadlock prevention are: 1. Removing the mutual exclusion condition implie

Differentiate between at and xt computer system, Differentiate between AT a...

Differentiate between AT and XT computer system? Ans XT -> Extended and AT->Advanced Technology Some differences between PC and XT include the type of power supply initia

Explain dataflow computing, DATAFLOW COMPUTING A substitute to the Von ...

DATAFLOW COMPUTING A substitute to the Von Neumann model of calculation is dataflow computation model. In the dataflow model, control is tied to flow of data. Order of instruct

Define clock rate, Define clock rate? The clock rate is given by, R=1/P...

Define clock rate? The clock rate is given by, R=1/P, where P is the length of single clock cycle.

Data, Data, information and knowledge - Information System The nature ...

Data, information and knowledge - Information System The nature of information can most easily be defined in the context of its relationship to data and knowledge. Bohn (1994)

Explain the while loop in c, Explain The while loop in C The while loop...

Explain The while loop in C The while loop keeps repeating an action until an associated test returns false. This is useful where the programmer does not know in advance how ma

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages