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

Explain height of a tree, Height of a tree The length of the longest pa...

Height of a tree The length of the longest path from root to any node is called as the height of the tree.

Defines a macro, Defines a macro Defines a macro with the given name, h...

Defines a macro Defines a macro with the given name, having as its value the given replacement text. After that (for the rest of the current source file), wherever the preproce

Avoiding overfitting - decision tree learning , Avoiding Overfitting : ...

Avoiding Overfitting : However remember there that in the previous lecture, there is over fitting that common problem in machine learning. Furthermore details to decision tree

Find 10s complement for decimal number, Q. Find 10's complement for decimal...

Q. Find 10's complement for decimal number? Adding 1 in 9's complement produces 10's complement. 10's complement of 0256 = 9743+1 = 9744. Please note on adding the number in

Program accept decimal number and convert it into given base, Q Develop a p...

Q Develop a program that accepts decimal number and converts it into given base. Fractional numbers are allowed and negative numbers are not allowed. Also check that entered number

Boolean algebra, Prove the following Boolean identities using the laws of B...

Prove the following Boolean identities using the laws of Boolean algebra (A + B)(A  + C) = A + BC Ans. (A+B)(A+C)=A+BC LHS AA+AC+AB+BC=A+AC+AB+BC OR  A((C+1)+A(B+1))+BC

Where engaged tone is generated, E ngaged tone is generated in the: (...

E ngaged tone is generated in the: (A)  Telephone instrument of calling subscriber (B)  Telephone instrument of called subscriber (C)  Exchange (D)  Repeater

Explain non-uniform memory access model (numa), Non-Uniform Memory Access M...

Non-Uniform Memory Access Model (NUMA) In shared memory multiprocessor systems, local memories are able to be connected with every processor. The collection of all local

What is single program multiple data, Q. What is Single Program Multiple Da...

Q. What is Single Program Multiple Data (SPMD) SPMD is in fact a "high level" programming model which can be built on any arrangement of previously described parallel programmi

Storage technology, Storage Technology: In the previous section, the, ...

Storage Technology: In the previous section, the, recent innovations relating to the processing aspects of computer technology were discussed briefly. In considering some of t

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