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

#title.sequential circuit, design modulo 12 up synchronous counter using t ...

design modulo 12 up synchronous counter using t flip flop

Project on adaptive concept map, to develop an adaptive concept map providi...

to develop an adaptive concept map providing personalized learning for Operating System subject with text file(in any form like html,ppt,txt,doc,pdf)as input

C, "Super ASCII", if it contains the character frequency equal to their asc...

"Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''a''-''z'') and the ascii values will starts from

How many input ANDand OR gates are required, How many two input AND gates a...

How many two input AND gates and two input OR gates are required to realize Y = BD+CE+AB ? Ans. Here three product terms, therefore three AND gates of two inputs are needed.

Give difference between compiler and interpreter, Give difference between c...

Give difference between compiler and interpreter. Compiler: It is a translator for machine independent HLL as FORTRAN and COBOL etc. Interpreter: It analysis the source

Computer graphics, raster scan and random display technology

raster scan and random display technology

#title., Ask queCreate a telephone directory. The heading should be 16-poi...

Ask queCreate a telephone directory. The heading should be 16-point Arial Font in bold The rest of the document should use 10-point font size Otherheadingsshould use 10-point Cour

Define the for loop, The for Loop The for loop works well where the num...

The for Loop The for loop works well where the number of iterations of the loop is known before the loop is entered. The head of the loop consists of three parts separated by s

Loop level-parallelism based on granularity size, Loop Level This is...

Loop Level This is one more level of parallelism where iterative loop instructions can be parallelized. Fine Granularity size is used at this level also. Simple loops in a

How to increase simulation speed, How to increase simulation speed ...

How to increase simulation speed First figure out what is eating away your CPU cycles. Is it 1. Compile time - Use a Make file to compile only files with changes and not

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages