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

Implication connective - modus ponens rule, Implication connective - Modus ...

Implication connective - Modus ponens rule: We notice that this is a trivial example, so it highlights how we use truth tables: as the first line is the only one when both abo

Explain about the voice recognition device, Explain about the Voice recogni...

Explain about the Voice recognition device Blind and partially-sighted people can communicate with a computer using microphone and software (keyboard and touch screens can't be

Logical database is a database structure., In sense of Database Management ...

In sense of Database Management System (DBMS) LOGICAL DATABASE is a database Structure. False LOGICAL DATABASE is not a database Structure.

Virtulization, Analyse the future of Operating Systems with reference to Vi...

Analyse the future of Operating Systems with reference to Virtualisation.words accepted#

Discuss different mode of centralized stored program control, Explain SPC. ...

Explain SPC. Also discuss the different modes of Centralized SPC In stored program control systems, set of instructions or a program to the computer is stored into its memory a

Explain the working of a 3-bit D/A converter, With the help of R-2R binary ...

With the help of R-2R binary network, explain the working of a 3-bit D/A converter and derive an expression for the output voltage. Ans: We see a 3-bit R-2R ladder D/A netwo

Illustrate associative memory, Q. Illustrate Associative Memory? The ti...

Q. Illustrate Associative Memory? The time required to find an item which is stored in memory can be decreased significantly if stored data can be identified for access by cont

Explain working of bit serial associative processor, Q. Explain working of ...

Q. Explain working of Bit Serial Associative Processor? When associative processor accepts bit serial memory organization subsequently it is known as bit serial associative pr

What are the advantages of store program control, What are the Advantages o...

What are the Advantages of store program control (I) Easy to maintain (II) Easy to control (III) Wide range of services can be provided to customers (IV) Flexible

Determine about the blocking suspicious behaviour, Determine about the bloc...

Determine about the blocking suspicious behaviour The response could be spontaneous and automatic, with an option to generate the alert message manually. The history recorded i

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