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

Difference between static and dynamic RAM, Difference between static and dy...

Difference between static and dynamic RAM. Draw the circuits of one cell of each and explain its working. Ans: Differentiation among Static RAM and Dynamic RAM: Static

Difference among using a filter and a query to find records, What is the di...

What is the difference among using a filter and a query to find records? Filter is used to quickly limit the records as we are already viewing in a Datasheet or a form to those

Cluster computing, The concept of clustering is definite as the use of mult...

The concept of clustering is definite as the use of multiple computers, typically PCs or multiple storage devices, UNIX workstations, and their interconnections, to form what appea

What does the future in gimp, Version 2.8 may bring a combined Transform to...

Version 2.8 may bring a combined Transform tool (Scale, Rotate,Flip and Perspective), more use of Cairo for attractive ant aliased graphics and more usability improvements. We will

Syntax and semantics for first-order logic , Syntax and Semanticsx and Sema...

Syntax and Semanticsx and Semantics for First-order logic - artificial intelligence: Propositional logic is limited  in its expressiveness: it may just represent true and false

Differentiate between adaptive and non-adaptive routing, Differentiate betw...

Differentiate between adaptive and non-adaptive routing. Adaptive routing defines the ability of a system, by which routes are characterised through their destination, to cha

What are the differences between one hot and binary encoding, What are the ...

What are the differences between one hot and binary encoding? Common classifications used to explain the state encoding of an FSM is Binary or highly encoded and one hot. A bin

Learning abilities of perceptrons, Learning Abilities of Perceptrons: ...

Learning Abilities of Perceptrons: Conversely computational learning theory is the study of what concepts particular learning schemes as representation and method detail as a

Problem specification - logic programs, Problem Specification : Hence ...

Problem Specification : Hence given the above context for "ILP" there we can state the learning problem as follows: that we are given a set of positive and a set of negative e

What do you mean by manual assembly, Q. What do you mean by Manual Assembly...

Q. What do you mean by Manual Assembly? It was an old method which required the programmer to translate every opcode in its numerical machine language representation by search

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