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

What is serial mouse, Q. What is Serial Mouse? Mice that use standard s...

Q. What is Serial Mouse? Mice that use standard serial port are known as 'serial'. Because Serial ports 1 and 4 (COM1, COM4 under DOS, /dev/ttyS0 and /dev/ttyS3 under Unix/GNU-

Selection - artificial intelligence, Selection - artificial intelligence: ...

Selection - artificial intelligence: However the first step is to choose the individuals that will have a shot at becoming the parents of the next generation. Hence this is kn

Open system interconnection networking model, Q. Open System Interconnectio...

Q. Open System Interconnection Networking Model? An open system is a model which allows any two different systems to communicate regardless of their underlying architecture. Th

C++, What are virtual Functions

What are virtual Functions

Towers of hanoi problem, The Towers of Hanoi Problem Towers of Hanoi pro...

The Towers of Hanoi Problem Towers of Hanoi problem is described. There are three pegs on which disks are "threaded" (there are holes in the disks to allow them to be placed on

Differentiate b/w program translation and interpretation, Differentiate bet...

Differentiate between program translation and program interpretation. The program translation model makes the execution gap through translating a program written in a program

Signed 1’s complement representation, Q. Signed 1s complement representatio...

Q. Signed 1s complement representation? Another possibility that is also simple is use of signed 1's complement. Signed 1's complement has a principal. Add both numbers includi

Define multi programming, Define multi programming? Many operating syst...

Define multi programming? Many operating systems are designed to enable the cpu to process a number of independent programs concurrently. This concept is  known as multi progra

Explain about annotational notations, Explain about Annotational Notations ...

Explain about Annotational Notations These notations may be applied to describe remark and illuminate about any element in the model. They are considered as explanatory of U

Define the addressing modes, Q. Define the ADDRESSING MODES? The elemen...

Q. Define the ADDRESSING MODES? The elementary set of operands in 8086 can reside in memory, register and immediate operand. How can these operands be retrievedby various addre

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