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 the object oriented analysis design, State about the Object ori...

State about the Object oriented analysis design Object oriented analysis design (OOAD) is a bottom up approach which supports viewing system as a set of components (objects) w

Determine the output of SR flip flop when S=1 and R=0, The output of SR fli...

The output of SR flip flop when S=1, R=0 is ? Ans. When for the SR flip-flop S=set i/p R=reset i/p, as S=1, R=0, Flip-flop will be set means output will be one.

Role of internet in progressing sciences, Ask question #Minimum 100 wordswh...

Ask question #Minimum 100 wordswhat is the .role of internet in progressing sciences accepted#

Sdr, advantages of sdr

advantages of sdr

Name some popular storage devices, Name some popular storage devices In...

Name some popular storage devices In contrasts with storage, which 1) retains data and programs irrespective of whether they are currently in use or not, (2) retains data

Define bidirectional bus, Define bidirectional bus? A bidirectional bus...

Define bidirectional bus? A bidirectional bus is that which permits the transfer of data either from memory to CPU during a read operation or from CPU to memory during write op

Explain the necessary conditions for deadlock to occur, Explain the necessa...

Explain the necessary conditions for deadlock to occur. Conditions for deadlock to arise are: i. Mutual exclusion: At least one resource must be held in a non-sharable mo

Explain about hamming error correcting code, Q. Explain about Hamming error...

Q. Explain about Hamming error correcting code? Richard Hamming at Bell Laboratories worked out this code. We will only introduce this code with help of an illustration for 4 b

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