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

How free-space is managed using bit vector implementation, How free-space i...

How free-space is managed using bit vector implementation? The free-space list is executed as a bit map or bit vector. Each block is shown by 1 bit. If the block is free, the b

What property of the architecture of 3g networks, Question: (a) Explain...

Question: (a) Explain how a Mobile Terminating call, from a PSTN phone, is processed in a GSM network. Illustrate your answer with a diagram. (b) Top-Net, a new telecommuni

What is testing, What is testing? List its types. Testing ensures that ...

What is testing? List its types. Testing ensures that the application is suitable for actual use and that it truthfully satisfies the requirements. Types are: Unit te

Why dynamic RAMs require refreshing, Explain briefly, why dynamic RAMs requ...

Explain briefly, why dynamic RAMs require refreshing? Ans: Due to the charge's natural tendency to distribute itself in a lower energy-state configuration that is, the charg

What is system software, What is system software? Give an example. It i...

What is system software? Give an example. It is a collection of program that are implemented as needed to perform functions such as I.  Receiving and interpreting user comma

What are the steps in executing the program, What are the steps in executin...

What are the steps in executing the program? 1.Fetch 2.Decode 3.Execute 4.Store

Temporary location, Compare zero-, one, two-, and three- address machines b...

Compare zero-, one, two-, and three- address machines by writing programs to compute                         X = (A + B x C)/(D - E x F) for every of the four machines.  Do n

Show encoding data options, Q. Show Encoding data options? PVM uses SUN...

Q. Show Encoding data options? PVM uses SUN's XDR library to make a machine independent data format if you request it. Settings for encoding option are:  PvmDataDefault: Use

Control flow diagram, creating a control flow question for atm system

creating a control flow question for atm system

Explain what is the difference among isr & function call, In ISR there is n...

In ISR there is no return value but in function call there is return value

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd